/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/acceleratedInterpolationQvasr_64.epf -i ../../../trunk/examples/svcomp/loops-crafted-1/iftelse.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-d966a43 [2022-01-31 23:25:35,777 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-01-31 23:25:35,778 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-01-31 23:25:35,843 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-01-31 23:25:35,843 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-01-31 23:25:35,845 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-01-31 23:25:35,847 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-01-31 23:25:35,851 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-01-31 23:25:35,852 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-01-31 23:25:35,855 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-01-31 23:25:35,856 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-01-31 23:25:35,856 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-01-31 23:25:35,856 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-01-31 23:25:35,857 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-01-31 23:25:35,857 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-01-31 23:25:35,858 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-01-31 23:25:35,858 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-01-31 23:25:35,859 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-01-31 23:25:35,860 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-01-31 23:25:35,861 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-01-31 23:25:35,861 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-01-31 23:25:35,863 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-01-31 23:25:35,866 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-01-31 23:25:35,867 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-01-31 23:25:35,874 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-01-31 23:25:35,874 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-01-31 23:25:35,874 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-01-31 23:25:35,875 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-01-31 23:25:35,876 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-01-31 23:25:35,876 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-01-31 23:25:35,877 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-01-31 23:25:35,877 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-01-31 23:25:35,878 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-01-31 23:25:35,879 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-01-31 23:25:35,880 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-01-31 23:25:35,880 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-01-31 23:25:35,880 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-01-31 23:25:35,880 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-01-31 23:25:35,880 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-01-31 23:25:35,881 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-01-31 23:25:35,881 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-01-31 23:25:35,882 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationQvasr_64.epf [2022-01-31 23:25:35,892 INFO L113 SettingsManager]: Loading preferences was successful [2022-01-31 23:25:35,892 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-01-31 23:25:35,893 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-01-31 23:25:35,893 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-01-31 23:25:35,894 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-01-31 23:25:35,894 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-01-31 23:25:35,894 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-01-31 23:25:35,894 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-01-31 23:25:35,894 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-01-31 23:25:35,894 INFO L138 SettingsManager]: * Use constant arrays=true [2022-01-31 23:25:35,894 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-01-31 23:25:35,895 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-01-31 23:25:35,895 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-01-31 23:25:35,895 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-01-31 23:25:35,895 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-01-31 23:25:35,895 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-31 23:25:35,895 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-01-31 23:25:35,895 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2022-01-31 23:25:35,895 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-01-31 23:25:35,895 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=QVASR [2022-01-31 23:25:35,895 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 23:25:36,065 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-01-31 23:25:36,079 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-01-31 23:25:36,080 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-01-31 23:25:36,081 INFO L271 PluginConnector]: Initializing CDTParser... [2022-01-31 23:25:36,083 INFO L275 PluginConnector]: CDTParser initialized [2022-01-31 23:25:36,083 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops-crafted-1/iftelse.c [2022-01-31 23:25:36,132 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/29ef1beda/6c2591aae89e453c852450782248f898/FLAG21fb5c2ce [2022-01-31 23:25:36,471 INFO L306 CDTParser]: Found 1 translation units. [2022-01-31 23:25:36,472 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops-crafted-1/iftelse.c [2022-01-31 23:25:36,484 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/29ef1beda/6c2591aae89e453c852450782248f898/FLAG21fb5c2ce [2022-01-31 23:25:36,495 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/29ef1beda/6c2591aae89e453c852450782248f898 [2022-01-31 23:25:36,497 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-01-31 23:25:36,500 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-01-31 23:25:36,503 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-01-31 23:25:36,503 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-01-31 23:25:36,505 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-01-31 23:25:36,506 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.01 11:25:36" (1/1) ... [2022-01-31 23:25:36,507 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@421aa732 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 11:25:36, skipping insertion in model container [2022-01-31 23:25:36,507 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.01 11:25:36" (1/1) ... [2022-01-31 23:25:36,512 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-01-31 23:25:36,521 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-01-31 23:25:36,643 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/iftelse.c[406,419] [2022-01-31 23:25:36,656 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-31 23:25:36,661 INFO L203 MainTranslator]: Completed pre-run [2022-01-31 23:25:36,696 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/iftelse.c[406,419] [2022-01-31 23:25:36,699 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-31 23:25:36,709 INFO L208 MainTranslator]: Completed translation [2022-01-31 23:25:36,710 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 11:25:36 WrapperNode [2022-01-31 23:25:36,710 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-01-31 23:25:36,712 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-01-31 23:25:36,712 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-01-31 23:25:36,712 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-01-31 23:25:36,719 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 11:25:36" (1/1) ... [2022-01-31 23:25:36,719 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 11:25:36" (1/1) ... [2022-01-31 23:25:36,724 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 11:25:36" (1/1) ... [2022-01-31 23:25:36,725 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 11:25:36" (1/1) ... [2022-01-31 23:25:36,733 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 11:25:36" (1/1) ... [2022-01-31 23:25:36,737 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 11:25:36" (1/1) ... [2022-01-31 23:25:36,738 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 11:25:36" (1/1) ... [2022-01-31 23:25:36,742 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-01-31 23:25:36,743 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-01-31 23:25:36,743 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-01-31 23:25:36,744 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-01-31 23:25:36,745 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 11:25:36" (1/1) ... [2022-01-31 23:25:36,752 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-31 23:25:36,759 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 23:25:36,769 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 23:25:36,787 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 23:25:36,806 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-01-31 23:25:36,806 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-01-31 23:25:36,806 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-01-31 23:25:36,806 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-01-31 23:25:36,806 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-01-31 23:25:36,806 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-01-31 23:25:36,806 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-01-31 23:25:36,806 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-01-31 23:25:36,806 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-01-31 23:25:36,807 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-01-31 23:25:36,807 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-01-31 23:25:36,807 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-01-31 23:25:36,807 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint [2022-01-31 23:25:36,807 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-01-31 23:25:36,808 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-01-31 23:25:36,808 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-01-31 23:25:36,808 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-01-31 23:25:36,808 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-01-31 23:25:36,809 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-01-31 23:25:36,809 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-01-31 23:25:36,856 INFO L234 CfgBuilder]: Building ICFG [2022-01-31 23:25:36,857 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-01-31 23:25:36,936 INFO L275 CfgBuilder]: Performing block encoding [2022-01-31 23:25:36,940 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-01-31 23:25:36,940 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-01-31 23:25:36,941 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.01 11:25:36 BoogieIcfgContainer [2022-01-31 23:25:36,941 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-01-31 23:25:36,943 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-01-31 23:25:36,943 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-01-31 23:25:36,945 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-01-31 23:25:36,945 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 31.01 11:25:36" (1/3) ... [2022-01-31 23:25:36,946 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@443a40a0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.01 11:25:36, skipping insertion in model container [2022-01-31 23:25:36,946 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 11:25:36" (2/3) ... [2022-01-31 23:25:36,946 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@443a40a0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.01 11:25:36, skipping insertion in model container [2022-01-31 23:25:36,946 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.01 11:25:36" (3/3) ... [2022-01-31 23:25:36,947 INFO L111 eAbstractionObserver]: Analyzing ICFG iftelse.c [2022-01-31 23:25:36,950 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:AcceleratedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-01-31 23:25:36,951 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-01-31 23:25:36,991 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-01-31 23:25:36,996 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=QVASR [2022-01-31 23:25:36,996 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-01-31 23:25:37,012 INFO L276 IsEmpty]: Start isEmpty. Operand has 22 states, 14 states have (on average 1.5) internal successors, (21), 16 states have internal predecessors, (21), 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 23:25:37,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-01-31 23:25:37,021 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 23:25:37,021 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 23:25:37,022 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 23:25:37,025 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 23:25:37,025 INFO L85 PathProgramCache]: Analyzing trace with hash -1034116429, now seen corresponding path program 1 times [2022-01-31 23:25:37,030 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 23:25:37,031 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [828964035] [2022-01-31 23:25:37,031 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 23:25:37,039 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 23:25:37,069 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 23:25:37,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:25:37,468 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 23:25:37,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:25:37,485 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 23:25:37,486 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 23:25:37,487 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [828964035] [2022-01-31 23:25:37,489 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [828964035] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 23:25:37,489 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 23:25:37,489 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-01-31 23:25:37,490 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [719905464] [2022-01-31 23:25:37,490 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 23:25:37,493 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-01-31 23:25:37,493 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 23:25:37,515 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-01-31 23:25:37,516 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-01-31 23:25:37,517 INFO L87 Difference]: Start difference. First operand has 22 states, 14 states have (on average 1.5) internal successors, (21), 16 states have internal predecessors, (21), 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 8 states, 8 states have (on average 1.25) internal successors, (10), 6 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 23:25:39,781 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-31 23:25:41,902 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-31 23:25:41,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 23:25:41,982 INFO L93 Difference]: Finished difference Result 53 states and 73 transitions. [2022-01-31 23:25:41,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-01-31 23:25:41,984 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.25) internal successors, (10), 6 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2022-01-31 23:25:41,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 23:25:41,988 INFO L225 Difference]: With dead ends: 53 [2022-01-31 23:25:41,988 INFO L226 Difference]: Without dead ends: 27 [2022-01-31 23:25:41,990 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2022-01-31 23:25:41,992 INFO L933 BasicCegarLoop]: 22 mSDtfsCounter, 38 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 132 mSolverCounterSat, 12 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 55 SdHoareTripleChecker+Invalid, 146 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 132 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.3s IncrementalHoareTripleChecker+Time [2022-01-31 23:25:41,993 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [38 Valid, 55 Invalid, 146 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 132 Invalid, 2 Unknown, 0 Unchecked, 4.3s Time] [2022-01-31 23:25:42,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2022-01-31 23:25:42,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 25. [2022-01-31 23:25:42,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 19 states have internal predecessors, (21), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-01-31 23:25:42,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 28 transitions. [2022-01-31 23:25:42,017 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 28 transitions. Word has length 14 [2022-01-31 23:25:42,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 23:25:42,017 INFO L470 AbstractCegarLoop]: Abstraction has 25 states and 28 transitions. [2022-01-31 23:25:42,017 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 1.25) internal successors, (10), 6 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 23:25:42,017 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 28 transitions. [2022-01-31 23:25:42,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-01-31 23:25:42,018 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 23:25:42,018 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 23:25:42,018 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-01-31 23:25:42,018 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 23:25:42,019 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 23:25:42,019 INFO L85 PathProgramCache]: Analyzing trace with hash -244126219, now seen corresponding path program 1 times [2022-01-31 23:25:42,019 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 23:25:42,019 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1261980832] [2022-01-31 23:25:42,020 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 23:25:42,588 INFO L236 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-01-31 23:25:42,588 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 23:25:42,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:25:42,936 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 23:25:42,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:25:42,945 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 23:25:43,031 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 23:25:43,031 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1261980832] [2022-01-31 23:25:43,031 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [1261980832] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 23:25:43,031 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 23:25:43,031 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-01-31 23:25:43,032 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1049127364] [2022-01-31 23:25:43,032 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 23:25:43,032 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-01-31 23:25:43,032 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 23:25:43,033 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-01-31 23:25:43,033 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2022-01-31 23:25:43,033 INFO L87 Difference]: Start difference. First operand 25 states and 28 transitions. Second operand has 11 states, 10 states have (on average 1.3) internal successors, (13), 9 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 23:25:45,123 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-31 23:25:48,146 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-31 23:25:50,306 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-31 23:25:52,380 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.07s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-31 23:25:54,284 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.90s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-31 23:25:56,379 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-31 23:25:56,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 23:25:56,454 INFO L93 Difference]: Finished difference Result 37 states and 42 transitions. [2022-01-31 23:25:56,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-01-31 23:25:56,457 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 1.3) internal successors, (13), 9 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 23:25:56,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 23:25:56,458 INFO L225 Difference]: With dead ends: 37 [2022-01-31 23:25:56,458 INFO L226 Difference]: Without dead ends: 26 [2022-01-31 23:25:56,458 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=63, Invalid=279, Unknown=0, NotChecked=0, Total=342 [2022-01-31 23:25:56,459 INFO L933 BasicCegarLoop]: 12 mSDtfsCounter, 22 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 16 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 13.3s IncrementalHoareTripleChecker+Time [2022-01-31 23:25:56,459 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [22 Valid, 44 Invalid, 110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 89 Invalid, 5 Unknown, 0 Unchecked, 13.3s Time] [2022-01-31 23:25:56,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2022-01-31 23:25:56,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 25. [2022-01-31 23:25:56,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 17 states have (on average 1.1176470588235294) internal successors, (19), 18 states have internal predecessors, (19), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-01-31 23:25:56,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 26 transitions. [2022-01-31 23:25:56,465 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 26 transitions. Word has length 17 [2022-01-31 23:25:56,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 23:25:56,465 INFO L470 AbstractCegarLoop]: Abstraction has 25 states and 26 transitions. [2022-01-31 23:25:56,465 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 1.3) internal successors, (13), 9 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 23:25:56,465 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 26 transitions. [2022-01-31 23:25:56,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-01-31 23:25:56,466 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 23:25:56,466 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 23:25:56,466 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-01-31 23:25:56,466 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 23:25:56,467 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 23:25:56,467 INFO L85 PathProgramCache]: Analyzing trace with hash 722095884, now seen corresponding path program 1 times [2022-01-31 23:25:56,467 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 23:25:56,467 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [840084398] [2022-01-31 23:25:56,467 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 23:25:56,718 INFO L236 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-01-31 23:25:56,719 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 23:25:56,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:25:57,000 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 23:25:57,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:25:57,007 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 23:26:20,723 WARN L228 SmtUtils]: Spent 23.71s on a formula simplification. DAG size of input: 38 DAG size of output: 32 (called from [L 183] de.uni_freiburg.informatik.ultimate.lib.acceleratedinterpolation.MetaTraceTransformer.getInductiveLoopInterpolants) [2022-01-31 23:26:44,152 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 23:26:44,153 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [840084398] [2022-01-31 23:26:44,153 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [840084398] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 23:26:44,153 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 23:26:44,153 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-01-31 23:26:44,153 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1058658817] [2022-01-31 23:26:44,153 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 23:26:44,153 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-01-31 23:26:44,154 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 23:26:44,154 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-01-31 23:26:44,154 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=184, Unknown=8, NotChecked=0, Total=240 [2022-01-31 23:26:44,154 INFO L87 Difference]: Start difference. First operand 25 states and 26 transitions. Second operand has 13 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 9 states have internal predecessors, (16), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-01-31 23:26:46,171 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-31 23:26:48,329 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-31 23:26:52,664 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-31 23:26:54,795 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-31 23:26:56,897 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-31 23:26:58,995 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-31 23:27:03,201 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-31 23:27:05,328 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-31 23:27:07,443 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-31 23:27:09,557 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-31 23:27:11,663 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-31 23:27:13,756 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-31 23:27:15,842 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.09s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-31 23:27:17,934 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.09s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-31 23:27:20,018 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.08s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-31 23:27:22,105 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.09s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-31 23:27:24,194 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.09s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-31 23:27:26,288 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.09s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-31 23:27:30,525 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-31 23:27:32,622 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-31 23:27:34,539 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.82s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-31 23:27:36,640 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-31 23:27:39,423 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.78s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-31 23:27:41,547 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-31 23:27:41,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 23:27:41,547 INFO L93 Difference]: Finished difference Result 38 states and 41 transitions. [2022-01-31 23:27:41,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-01-31 23:27:41,636 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 9 states have internal predecessors, (16), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 22 [2022-01-31 23:27:41,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 23:27:41,638 INFO L225 Difference]: With dead ends: 38 [2022-01-31 23:27:41,638 INFO L226 Difference]: Without dead ends: 36 [2022-01-31 23:27:41,639 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 6 SyntacticMatches, 2 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 142 ImplicationChecksByTransitivity, 30.4s TimeCoverageRelationStatistics Valid=115, Invalid=524, Unknown=11, NotChecked=0, Total=650 [2022-01-31 23:27:41,640 INFO L933 BasicCegarLoop]: 12 mSDtfsCounter, 35 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 107 mSolverCounterSat, 17 mSolverCounterUnsat, 23 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 48.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 107 IncrementalHoareTripleChecker+Invalid, 23 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 50.4s IncrementalHoareTripleChecker+Time [2022-01-31 23:27:41,640 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [35 Valid, 53 Invalid, 147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 107 Invalid, 23 Unknown, 0 Unchecked, 50.4s Time] [2022-01-31 23:27:41,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2022-01-31 23:27:41,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 27. [2022-01-31 23:27:41,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 19 states have (on average 1.1578947368421053) internal successors, (22), 19 states have internal predecessors, (22), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-01-31 23:27:41,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 29 transitions. [2022-01-31 23:27:41,648 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 29 transitions. Word has length 22 [2022-01-31 23:27:41,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 23:27:41,648 INFO L470 AbstractCegarLoop]: Abstraction has 27 states and 29 transitions. [2022-01-31 23:27:41,649 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 9 states have internal predecessors, (16), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-01-31 23:27:41,649 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 29 transitions. [2022-01-31 23:27:41,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-01-31 23:27:41,649 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 23:27:41,649 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 23:27:41,649 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-01-31 23:27:41,649 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 23:27:41,650 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 23:27:41,650 INFO L85 PathProgramCache]: Analyzing trace with hash 779354186, now seen corresponding path program 1 times [2022-01-31 23:27:41,650 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 23:27:41,650 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [957607905] [2022-01-31 23:27:41,650 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 23:27:41,755 INFO L236 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-01-31 23:27:41,755 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 23:27:41,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:27:42,212 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 23:27:42,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:27:42,233 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 23:28:06,266 WARN L228 SmtUtils]: Spent 24.02s on a formula simplification. DAG size of input: 41 DAG size of output: 35 (called from [L 183] de.uni_freiburg.informatik.ultimate.lib.acceleratedinterpolation.MetaTraceTransformer.getInductiveLoopInterpolants) [2022-01-31 23:28:10,136 WARN L838 $PredicateComparison]: unable to prove that (and (<= (mod (div (mod c_main_~i~0 4294967296) 2) 4294967296) (mod c_main_~j~0 4294967296)) (exists ((aux_div_aux_mod_v_main_~n~0_BEFORE_RETURN_2_44_113 Int) (aux_mod_aux_mod_v_main_~n~0_BEFORE_RETURN_2_44_113 Int) (aux_div_v_main_~n~0_BEFORE_RETURN_2_44 Int)) (let ((.cse1 (+ aux_mod_aux_mod_v_main_~n~0_BEFORE_RETURN_2_44_113 (* aux_div_aux_mod_v_main_~n~0_BEFORE_RETURN_2_44_113 4294967296))) (.cse0 (* aux_div_v_main_~n~0_BEFORE_RETURN_2_44 4294967296))) (and (<= aux_mod_aux_mod_v_main_~n~0_BEFORE_RETURN_2_44_113 20000001) (< .cse0 .cse1) (<= 0 aux_mod_aux_mod_v_main_~n~0_BEFORE_RETURN_2_44_113) (< .cse1 (+ .cse0 4294967296)))))) is different from false [2022-01-31 23:28:12,257 WARN L860 $PredicateComparison]: unable to prove that (and (<= (mod (div (mod c_main_~i~0 4294967296) 2) 4294967296) (mod c_main_~j~0 4294967296)) (exists ((aux_div_aux_mod_v_main_~n~0_BEFORE_RETURN_2_44_113 Int) (aux_mod_aux_mod_v_main_~n~0_BEFORE_RETURN_2_44_113 Int) (aux_div_v_main_~n~0_BEFORE_RETURN_2_44 Int)) (let ((.cse1 (+ aux_mod_aux_mod_v_main_~n~0_BEFORE_RETURN_2_44_113 (* aux_div_aux_mod_v_main_~n~0_BEFORE_RETURN_2_44_113 4294967296))) (.cse0 (* aux_div_v_main_~n~0_BEFORE_RETURN_2_44 4294967296))) (and (<= aux_mod_aux_mod_v_main_~n~0_BEFORE_RETURN_2_44_113 20000001) (< .cse0 .cse1) (<= 0 aux_mod_aux_mod_v_main_~n~0_BEFORE_RETURN_2_44_113) (< .cse1 (+ .cse0 4294967296)))))) is different from true [2022-01-31 23:28:12,260 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 23:28:12,260 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [957607905] [2022-01-31 23:28:12,260 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [957607905] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 23:28:12,260 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 23:28:12,260 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-01-31 23:28:12,260 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [326108602] [2022-01-31 23:28:12,260 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 23:28:12,260 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-01-31 23:28:12,261 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 23:28:12,261 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-01-31 23:28:12,261 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=218, Unknown=2, NotChecked=30, Total=306 [2022-01-31 23:28:12,261 INFO L87 Difference]: Start difference. First operand 27 states and 29 transitions. Second operand has 15 states, 14 states have (on average 1.1428571428571428) internal successors, (16), 10 states have internal predecessors, (16), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-01-31 23:28:14,372 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-31 23:28:16,544 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-31 23:28:18,646 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.10s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-31 23:28:20,810 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-31 23:28:22,975 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-31 23:28:25,078 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.10s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-31 23:28:27,181 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.10s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-31 23:28:29,277 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.10s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-31 23:28:31,377 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-31 23:28:33,481 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.10s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-31 23:28:35,585 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.10s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-31 23:28:37,683 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.10s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-31 23:28:39,777 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.09s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-31 23:28:41,874 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.10s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-31 23:28:44,054 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-31 23:28:46,163 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.11s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-31 23:28:48,262 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.10s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-31 23:28:50,395 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.13s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-31 23:28:52,533 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.14s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-31 23:28:54,666 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.13s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-31 23:28:56,801 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.13s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-31 23:28:56,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 23:28:56,934 INFO L93 Difference]: Finished difference Result 44 states and 47 transitions. [2022-01-31 23:28:56,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-01-31 23:28:56,934 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 1.1428571428571428) internal successors, (16), 10 states have internal predecessors, (16), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 22 [2022-01-31 23:28:56,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 23:28:56,935 INFO L225 Difference]: With dead ends: 44 [2022-01-31 23:28:56,935 INFO L226 Difference]: Without dead ends: 42 [2022-01-31 23:28:56,936 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 26 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 171 ImplicationChecksByTransitivity, 6.5s TimeCoverageRelationStatistics Valid=138, Invalid=566, Unknown=2, NotChecked=50, Total=756 [2022-01-31 23:28:56,937 INFO L933 BasicCegarLoop]: 11 mSDtfsCounter, 40 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 18 mSolverCounterUnsat, 21 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 42.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 168 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 21 IncrementalHoareTripleChecker+Unknown, 32 IncrementalHoareTripleChecker+Unchecked, 44.2s IncrementalHoareTripleChecker+Time [2022-01-31 23:28:56,938 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [41 Valid, 34 Invalid, 168 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 97 Invalid, 21 Unknown, 32 Unchecked, 44.2s Time] [2022-01-31 23:28:56,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2022-01-31 23:28:56,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 41. [2022-01-31 23:28:56,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 29 states have (on average 1.1379310344827587) internal successors, (33), 30 states have internal predecessors, (33), 6 states have call successors, (6), 6 states have call predecessors, (6), 5 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) [2022-01-31 23:28:56,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 44 transitions. [2022-01-31 23:28:56,961 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 44 transitions. Word has length 22 [2022-01-31 23:28:56,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 23:28:56,962 INFO L470 AbstractCegarLoop]: Abstraction has 41 states and 44 transitions. [2022-01-31 23:28:56,962 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 1.1428571428571428) internal successors, (16), 10 states have internal predecessors, (16), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-01-31 23:28:56,962 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 44 transitions. [2022-01-31 23:28:56,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-01-31 23:28:56,963 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 23:28:56,963 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 23:28:56,963 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-01-31 23:28:56,963 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 23:28:56,963 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 23:28:56,963 INFO L85 PathProgramCache]: Analyzing trace with hash 545276835, now seen corresponding path program 2 times [2022-01-31 23:28:56,963 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 23:28:56,963 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1140213713] [2022-01-31 23:28:56,964 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 23:28:57,060 INFO L236 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-01-31 23:28:57,061 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 23:28:57,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:28:57,674 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 23:28:57,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:28:57,691 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 23:29:20,969 WARN L228 SmtUtils]: Spent 23.27s on a formula simplification. DAG size of input: 41 DAG size of output: 35 (called from [L 183] de.uni_freiburg.informatik.ultimate.lib.acceleratedinterpolation.MetaTraceTransformer.getInductiveLoopInterpolants) [2022-01-31 23:29:44,704 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 (mod (+ c_main_~i~0 4294967293) 4294967296))) (and (< .cse0 (mod c_main_~n~0 4294967296)) (<= (mod (div .cse0 2) 4294967296) (mod c_main_~j~0 4294967296)))) is different from true [2022-01-31 23:30:10,052 WARN L228 SmtUtils]: Spent 8.42s on a formula simplification that was a NOOP. DAG size: 20 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-01-31 23:30:12,163 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 (mod (+ c_main_~i~0 4294967293) 4294967296)) (.cse1 (mod c_main_~n~0 4294967296))) (and (not (= (mod c_main_~i~0 2) 0)) (<= (mod (div .cse0 2) 4294967296) (mod (+ c_main_~j~0 4294967293) 4294967296)) (< 0 .cse1) (< .cse0 .cse1))) is different from true [2022-01-31 23:30:14,345 WARN L838 $PredicateComparison]: unable to prove that (exists ((aux_div_aux_mod_v_main_~i~0_BEFORE_CALL_4_57_50 Int) (aux_mod_aux_mod_v_main_~n~0_BEFORE_CALL_4_42_53 Int) (aux_div_aux_mod_aux_mod_v_main_~i~0_BEFORE_CALL_4_57_50_133 Int) (aux_div_aux_div_aux_mod_aux_mod_aux_mod_v_main_~i~0_BEFORE_CALL_4_57_50_133_67_87 Int) (aux_mod_aux_div_aux_mod_aux_mod_aux_mod_v_main_~i~0_BEFORE_CALL_4_57_50_133_67_87 Int) (aux_mod_v_main_~j~0_BEFORE_CALL_4_57 Int) (aux_mod_aux_mod_aux_mod_aux_mod_v_main_~i~0_BEFORE_CALL_4_57_50_133_67 Int) (aux_div_aux_mod_v_main_~n~0_BEFORE_CALL_4_42_53 Int)) (let ((.cse5 (* 2 aux_div_aux_mod_v_main_~i~0_BEFORE_CALL_4_57_50)) (.cse4 (* 2 aux_mod_aux_div_aux_mod_aux_mod_aux_mod_v_main_~i~0_BEFORE_CALL_4_57_50_133_67_87)) (.cse7 (* 8589934592 aux_div_aux_div_aux_mod_aux_mod_aux_mod_v_main_~i~0_BEFORE_CALL_4_57_50_133_67_87))) (let ((.cse2 (+ aux_mod_aux_mod_v_main_~n~0_BEFORE_CALL_4_42_53 (* 4294967296 aux_div_aux_mod_v_main_~n~0_BEFORE_CALL_4_42_53))) (.cse0 (+ aux_mod_aux_mod_aux_mod_aux_mod_v_main_~i~0_BEFORE_CALL_4_57_50_133_67 .cse4 .cse7)) (.cse6 (+ .cse5 4294967295)) (.cse1 (+ aux_mod_aux_mod_aux_mod_aux_mod_v_main_~i~0_BEFORE_CALL_4_57_50_133_67 .cse4 (* aux_div_aux_mod_aux_mod_v_main_~i~0_BEFORE_CALL_4_57_50_133 4294967296) .cse7))) (and (<= 0 .cse0) (< .cse1 (+ aux_mod_aux_mod_v_main_~n~0_BEFORE_CALL_4_42_53 4294967296)) (< aux_mod_aux_div_aux_mod_aux_mod_aux_mod_v_main_~i~0_BEFORE_CALL_4_57_50_133_67_87 4294967296) (<= 0 aux_mod_aux_mod_v_main_~n~0_BEFORE_CALL_4_42_53) (<= 0 aux_mod_aux_mod_aux_mod_aux_mod_v_main_~i~0_BEFORE_CALL_4_57_50_133_67) (< 0 .cse2) (let ((.cse3 (<= (mod (div (mod (+ aux_mod_aux_mod_aux_mod_aux_mod_v_main_~i~0_BEFORE_CALL_4_57_50_133_67 .cse4 3) 4294967296) 2) 4294967296) (mod (+ aux_mod_v_main_~j~0_BEFORE_CALL_4_57 3) 4294967296)))) (or (and (= |c___VERIFIER_assert_#in~cond| 0) (not .cse3)) (and .cse3 (= |c___VERIFIER_assert_#in~cond| 1)))) (<= aux_mod_aux_div_aux_mod_aux_mod_aux_mod_v_main_~i~0_BEFORE_CALL_4_57_50_133_67_87 aux_mod_v_main_~j~0_BEFORE_CALL_4_57) (< .cse2 4294967296) (< aux_mod_aux_mod_v_main_~n~0_BEFORE_CALL_4_42_53 4294967296) (<= 0 aux_mod_v_main_~j~0_BEFORE_CALL_4_57) (< aux_mod_v_main_~j~0_BEFORE_CALL_4_57 4294967296) (< .cse1 8589934592) (<= 0 aux_mod_aux_div_aux_mod_aux_mod_aux_mod_v_main_~i~0_BEFORE_CALL_4_57_50_133_67_87) (< .cse1 (+ .cse5 4294967297)) (<= 4294967296 .cse1) (not (= .cse6 .cse1)) (< .cse0 4294967296) (<= .cse6 .cse1) (< aux_mod_aux_mod_aux_mod_aux_mod_v_main_~i~0_BEFORE_CALL_4_57_50_133_67 2))))) is different from false [2022-01-31 23:30:16,483 WARN L838 $PredicateComparison]: unable to prove that (and (< 0 (mod c_main_~n~0 4294967296)) (exists ((aux_div_aux_div_aux_mod_aux_mod_aux_mod_v_main_~i~0_37_46_39_111_139_77 Int) (aux_mod_aux_div_aux_mod_aux_mod_aux_mod_v_main_~i~0_37_46_39_111_139_77 Int) (aux_mod_aux_mod_aux_mod_aux_mod_v_main_~i~0_37_46_39_111_139 Int) (aux_div_aux_mod_aux_mod_v_main_~i~0_37_46_39_111 Int) (aux_mod_v_main_~j~0_34_46 Int) (aux_div_aux_mod_v_main_~i~0_37_46_39 Int)) (let ((.cse5 (* 8589934592 aux_div_aux_div_aux_mod_aux_mod_aux_mod_v_main_~i~0_37_46_39_111_139_77)) (.cse3 (* aux_mod_aux_div_aux_mod_aux_mod_aux_mod_v_main_~i~0_37_46_39_111_139_77 2))) (let ((.cse6 (+ .cse5 aux_mod_aux_mod_aux_mod_aux_mod_v_main_~i~0_37_46_39_111_139 .cse3 4294967296)) (.cse1 (* aux_div_aux_mod_aux_mod_v_main_~i~0_37_46_39_111 4294967296)) (.cse4 (* aux_div_aux_mod_v_main_~i~0_37_46_39 2)) (.cse0 (+ .cse5 aux_mod_aux_mod_aux_mod_aux_mod_v_main_~i~0_37_46_39_111_139 .cse3))) (and (< .cse0 .cse1) (<= 0 aux_mod_aux_mod_aux_mod_aux_mod_v_main_~i~0_37_46_39_111_139) (let ((.cse2 (<= (mod (div (mod (+ 3 aux_mod_aux_mod_aux_mod_aux_mod_v_main_~i~0_37_46_39_111_139 .cse3) 4294967296) 2) 4294967296) (mod (+ 3 aux_mod_v_main_~j~0_34_46) 4294967296)))) (or (and .cse2 (= |c___VERIFIER_assert_#in~cond| 1)) (and (not .cse2) (= |c___VERIFIER_assert_#in~cond| 0)))) (< .cse0 (+ .cse4 1)) (<= 0 aux_mod_aux_div_aux_mod_aux_mod_aux_mod_v_main_~i~0_37_46_39_111_139_77) (not (= (+ .cse5 aux_mod_aux_mod_aux_mod_aux_mod_v_main_~i~0_37_46_39_111_139 .cse3 (* aux_div_aux_mod_v_main_~i~0_37_46_39 (- 2)) 1) 0)) (< aux_mod_aux_div_aux_mod_aux_mod_aux_mod_v_main_~i~0_37_46_39_111_139_77 4294967296) (<= .cse1 .cse6) (<= aux_mod_aux_div_aux_mod_aux_mod_aux_mod_v_main_~i~0_37_46_39_111_139_77 aux_mod_v_main_~j~0_34_46) (< .cse6 (+ .cse1 (mod c_main_~n~0 4294967296))) (< aux_mod_v_main_~j~0_34_46 4294967296) (<= .cse4 (+ .cse5 aux_mod_aux_mod_aux_mod_aux_mod_v_main_~i~0_37_46_39_111_139 .cse3 1)) (<= 0 .cse0) (< aux_mod_aux_mod_aux_mod_aux_mod_v_main_~i~0_37_46_39_111_139 2) (< .cse0 4294967296) (<= 0 aux_mod_v_main_~j~0_34_46)))))) is different from false [2022-01-31 23:30:18,618 WARN L838 $PredicateComparison]: unable to prove that (and (= |c___VERIFIER_assert_#in~cond| c___VERIFIER_assert_~cond) (< 0 (mod c_main_~n~0 4294967296)) (exists ((aux_div_aux_div_aux_mod_aux_mod_aux_mod_v_main_~i~0_37_46_39_111_139_77 Int) (aux_mod_aux_div_aux_mod_aux_mod_aux_mod_v_main_~i~0_37_46_39_111_139_77 Int) (aux_mod_aux_mod_aux_mod_aux_mod_v_main_~i~0_37_46_39_111_139 Int) (aux_div_aux_mod_aux_mod_v_main_~i~0_37_46_39_111 Int) (aux_mod_v_main_~j~0_34_46 Int) (aux_div_aux_mod_v_main_~i~0_37_46_39 Int)) (let ((.cse5 (* 8589934592 aux_div_aux_div_aux_mod_aux_mod_aux_mod_v_main_~i~0_37_46_39_111_139_77)) (.cse3 (* aux_mod_aux_div_aux_mod_aux_mod_aux_mod_v_main_~i~0_37_46_39_111_139_77 2))) (let ((.cse6 (+ .cse5 aux_mod_aux_mod_aux_mod_aux_mod_v_main_~i~0_37_46_39_111_139 .cse3 4294967296)) (.cse1 (* aux_div_aux_mod_aux_mod_v_main_~i~0_37_46_39_111 4294967296)) (.cse4 (* aux_div_aux_mod_v_main_~i~0_37_46_39 2)) (.cse0 (+ .cse5 aux_mod_aux_mod_aux_mod_aux_mod_v_main_~i~0_37_46_39_111_139 .cse3))) (and (< .cse0 .cse1) (<= 0 aux_mod_aux_mod_aux_mod_aux_mod_v_main_~i~0_37_46_39_111_139) (let ((.cse2 (<= (mod (div (mod (+ 3 aux_mod_aux_mod_aux_mod_aux_mod_v_main_~i~0_37_46_39_111_139 .cse3) 4294967296) 2) 4294967296) (mod (+ 3 aux_mod_v_main_~j~0_34_46) 4294967296)))) (or (and .cse2 (= |c___VERIFIER_assert_#in~cond| 1)) (and (not .cse2) (= |c___VERIFIER_assert_#in~cond| 0)))) (< .cse0 (+ .cse4 1)) (<= 0 aux_mod_aux_div_aux_mod_aux_mod_aux_mod_v_main_~i~0_37_46_39_111_139_77) (not (= (+ .cse5 aux_mod_aux_mod_aux_mod_aux_mod_v_main_~i~0_37_46_39_111_139 .cse3 (* aux_div_aux_mod_v_main_~i~0_37_46_39 (- 2)) 1) 0)) (< aux_mod_aux_div_aux_mod_aux_mod_aux_mod_v_main_~i~0_37_46_39_111_139_77 4294967296) (<= .cse1 .cse6) (<= aux_mod_aux_div_aux_mod_aux_mod_aux_mod_v_main_~i~0_37_46_39_111_139_77 aux_mod_v_main_~j~0_34_46) (< .cse6 (+ .cse1 (mod c_main_~n~0 4294967296))) (< aux_mod_v_main_~j~0_34_46 4294967296) (<= .cse4 (+ .cse5 aux_mod_aux_mod_aux_mod_aux_mod_v_main_~i~0_37_46_39_111_139 .cse3 1)) (<= 0 .cse0) (< aux_mod_aux_mod_aux_mod_aux_mod_v_main_~i~0_37_46_39_111_139 2) (< .cse0 4294967296) (<= 0 aux_mod_v_main_~j~0_34_46)))))) is different from false [2022-01-31 23:30:20,751 WARN L838 $PredicateComparison]: unable to prove that (and (not (= c___VERIFIER_assert_~cond 0)) (= |c___VERIFIER_assert_#in~cond| c___VERIFIER_assert_~cond) (< 0 (mod c_main_~n~0 4294967296)) (exists ((aux_div_aux_div_aux_mod_aux_mod_aux_mod_v_main_~i~0_37_46_39_111_139_77 Int) (aux_mod_aux_div_aux_mod_aux_mod_aux_mod_v_main_~i~0_37_46_39_111_139_77 Int) (aux_mod_aux_mod_aux_mod_aux_mod_v_main_~i~0_37_46_39_111_139 Int) (aux_div_aux_mod_aux_mod_v_main_~i~0_37_46_39_111 Int) (aux_mod_v_main_~j~0_34_46 Int) (aux_div_aux_mod_v_main_~i~0_37_46_39 Int)) (let ((.cse5 (* 8589934592 aux_div_aux_div_aux_mod_aux_mod_aux_mod_v_main_~i~0_37_46_39_111_139_77)) (.cse3 (* aux_mod_aux_div_aux_mod_aux_mod_aux_mod_v_main_~i~0_37_46_39_111_139_77 2))) (let ((.cse6 (+ .cse5 aux_mod_aux_mod_aux_mod_aux_mod_v_main_~i~0_37_46_39_111_139 .cse3 4294967296)) (.cse1 (* aux_div_aux_mod_aux_mod_v_main_~i~0_37_46_39_111 4294967296)) (.cse4 (* aux_div_aux_mod_v_main_~i~0_37_46_39 2)) (.cse0 (+ .cse5 aux_mod_aux_mod_aux_mod_aux_mod_v_main_~i~0_37_46_39_111_139 .cse3))) (and (< .cse0 .cse1) (<= 0 aux_mod_aux_mod_aux_mod_aux_mod_v_main_~i~0_37_46_39_111_139) (let ((.cse2 (<= (mod (div (mod (+ 3 aux_mod_aux_mod_aux_mod_aux_mod_v_main_~i~0_37_46_39_111_139 .cse3) 4294967296) 2) 4294967296) (mod (+ 3 aux_mod_v_main_~j~0_34_46) 4294967296)))) (or (and .cse2 (= |c___VERIFIER_assert_#in~cond| 1)) (and (not .cse2) (= |c___VERIFIER_assert_#in~cond| 0)))) (< .cse0 (+ .cse4 1)) (<= 0 aux_mod_aux_div_aux_mod_aux_mod_aux_mod_v_main_~i~0_37_46_39_111_139_77) (not (= (+ .cse5 aux_mod_aux_mod_aux_mod_aux_mod_v_main_~i~0_37_46_39_111_139 .cse3 (* aux_div_aux_mod_v_main_~i~0_37_46_39 (- 2)) 1) 0)) (< aux_mod_aux_div_aux_mod_aux_mod_aux_mod_v_main_~i~0_37_46_39_111_139_77 4294967296) (<= .cse1 .cse6) (<= aux_mod_aux_div_aux_mod_aux_mod_aux_mod_v_main_~i~0_37_46_39_111_139_77 aux_mod_v_main_~j~0_34_46) (< .cse6 (+ .cse1 (mod c_main_~n~0 4294967296))) (< aux_mod_v_main_~j~0_34_46 4294967296) (<= .cse4 (+ .cse5 aux_mod_aux_mod_aux_mod_aux_mod_v_main_~i~0_37_46_39_111_139 .cse3 1)) (<= 0 .cse0) (< aux_mod_aux_mod_aux_mod_aux_mod_v_main_~i~0_37_46_39_111_139 2) (< .cse0 4294967296) (<= 0 aux_mod_v_main_~j~0_34_46)))))) is different from false [2022-01-31 23:30:22,958 WARN L838 $PredicateComparison]: unable to prove that (and (exists ((aux_mod_aux_mod_aux_mod_aux_mod_aux_mod_aux_mod_v_main_~i~0_37_46_39_111_139_161_80 Int) (aux_div_aux_mod_v_main_~n~0_BEFORE_RETURN_4_44_55 Int) (aux_div_aux_div_aux_mod_aux_mod_aux_mod_v_main_~i~0_37_46_39_111_139_77 Int) (aux_div_aux_mod_aux_mod_aux_mod_aux_mod_v_main_~i~0_37_46_39_111_139_161 Int) (aux_div_aux_mod_v_main_~j~0_34_46_48 Int) (aux_mod_aux_div_aux_mod_aux_mod_aux_mod_v_main_~i~0_37_46_39_111_139_77 Int) (aux_mod_aux_mod_v_main_~j~0_34_46_48 Int) (aux_div_aux_div_aux_mod_aux_mod_aux_mod_aux_mod_aux_mod_v_main_~i~0_37_46_39_111_139_161_80_100 Int) (aux_div_aux_mod_v_main_~i~0_37_46_39 Int) (aux_mod_aux_div_aux_mod_aux_mod_aux_mod_aux_mod_aux_mod_v_main_~i~0_37_46_39_111_139_161_80_100 Int) (aux_mod_aux_mod_v_main_~n~0_BEFORE_RETURN_4_44_55 Int) (aux_div_aux_mod_aux_mod_v_main_~i~0_37_46_39_111 Int)) (let ((.cse12 (* 8589934592 aux_div_aux_div_aux_mod_aux_mod_aux_mod_v_main_~i~0_37_46_39_111_139_77)) (.cse3 (* aux_div_aux_mod_v_main_~i~0_37_46_39 2)) (.cse10 (* 8589934592 aux_div_aux_div_aux_mod_aux_mod_aux_mod_aux_mod_aux_mod_v_main_~i~0_37_46_39_111_139_161_80_100)) (.cse11 (* aux_mod_aux_div_aux_mod_aux_mod_aux_mod_aux_mod_aux_mod_v_main_~i~0_37_46_39_111_139_161_80_100 2)) (.cse13 (* aux_div_aux_mod_aux_mod_aux_mod_aux_mod_v_main_~i~0_37_46_39_111_139_161 4294967296))) (let ((.cse1 (+ .cse10 .cse11 aux_mod_aux_mod_aux_mod_aux_mod_aux_mod_aux_mod_v_main_~i~0_37_46_39_111_139_161_80 .cse13)) (.cse0 (* aux_mod_aux_div_aux_mod_aux_mod_aux_mod_v_main_~i~0_37_46_39_111_139_77 2)) (.cse4 (+ 2 .cse3)) (.cse2 (+ .cse10 .cse11 .cse12 aux_mod_aux_mod_aux_mod_aux_mod_aux_mod_aux_mod_v_main_~i~0_37_46_39_111_139_161_80 .cse13)) (.cse9 (+ (* 4294967296 aux_div_aux_mod_v_main_~n~0_BEFORE_RETURN_4_44_55) aux_mod_aux_mod_v_main_~n~0_BEFORE_RETURN_4_44_55)) (.cse5 (* aux_div_aux_mod_aux_mod_v_main_~i~0_37_46_39_111 4294967296)) (.cse6 (+ .cse10 .cse11 .cse12 aux_mod_aux_mod_aux_mod_aux_mod_aux_mod_aux_mod_v_main_~i~0_37_46_39_111_139_161_80 .cse13 4294967293)) (.cse7 (+ .cse10 .cse11 aux_mod_aux_mod_aux_mod_aux_mod_aux_mod_aux_mod_v_main_~i~0_37_46_39_111_139_161_80)) (.cse8 (+ aux_mod_aux_mod_v_main_~j~0_34_46_48 (* aux_div_aux_mod_v_main_~j~0_34_46_48 4294967296)))) (and (<= (+ 3 .cse0) .cse1) (< aux_mod_aux_mod_v_main_~j~0_34_46_48 4294967296) (< aux_mod_aux_div_aux_mod_aux_mod_aux_mod_aux_mod_aux_mod_v_main_~i~0_37_46_39_111_139_161_80_100 4294967296) (<= 0 aux_mod_aux_mod_v_main_~n~0_BEFORE_RETURN_4_44_55) (<= 0 aux_mod_aux_mod_aux_mod_aux_mod_aux_mod_aux_mod_v_main_~i~0_37_46_39_111_139_161_80) (< .cse2 (+ .cse3 4)) (not (= .cse2 .cse4)) (< .cse2 (+ .cse5 3)) (<= 0 aux_mod_aux_div_aux_mod_aux_mod_aux_mod_v_main_~i~0_37_46_39_111_139_77) (< aux_mod_aux_mod_aux_mod_aux_mod_aux_mod_aux_mod_v_main_~i~0_37_46_39_111_139_161_80 2) (< aux_mod_aux_div_aux_mod_aux_mod_aux_mod_v_main_~i~0_37_46_39_111_139_77 4294967296) (< .cse6 (+ .cse5 aux_mod_aux_mod_v_main_~n~0_BEFORE_RETURN_4_44_55)) (<= 3 .cse2) (< .cse1 (+ 5 .cse0)) (<= 0 .cse7) (<= 0 aux_mod_aux_mod_v_main_~j~0_34_46_48) (< .cse8 4294967299) (< .cse9 4294967296) (< aux_mod_aux_mod_v_main_~n~0_BEFORE_RETURN_4_44_55 4294967296) (<= .cse4 .cse2) (< .cse2 4294967299) (<= 0 aux_mod_aux_div_aux_mod_aux_mod_aux_mod_aux_mod_aux_mod_v_main_~i~0_37_46_39_111_139_161_80_100) (<= (+ aux_mod_aux_div_aux_mod_aux_mod_aux_mod_v_main_~i~0_37_46_39_111_139_77 3) .cse8) (< 0 .cse9) (<= .cse5 .cse6) (<= aux_mod_aux_div_aux_mod_aux_mod_aux_mod_aux_mod_aux_mod_v_main_~i~0_37_46_39_111_139_161_80_100 aux_mod_aux_mod_v_main_~j~0_34_46_48) (< .cse7 4294967296) (<= 3 .cse8))))) (<= (mod (div (mod c_main_~i~0 4294967296) 2) 4294967296) (mod c_main_~j~0 4294967296))) is different from false [2022-01-31 23:30:25,071 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((aux_mod_aux_mod_aux_mod_aux_mod_aux_mod_aux_mod_v_main_~i~0_37_46_39_111_139_161_80 Int) (aux_div_aux_mod_v_main_~n~0_BEFORE_RETURN_4_44_55 Int) (aux_div_aux_div_aux_mod_aux_mod_aux_mod_v_main_~i~0_37_46_39_111_139_77 Int) (aux_div_aux_mod_aux_mod_aux_mod_aux_mod_v_main_~i~0_37_46_39_111_139_161 Int) (aux_div_aux_mod_v_main_~j~0_34_46_48 Int) (aux_mod_aux_div_aux_mod_aux_mod_aux_mod_v_main_~i~0_37_46_39_111_139_77 Int) (aux_mod_aux_mod_v_main_~j~0_34_46_48 Int) (aux_div_aux_div_aux_mod_aux_mod_aux_mod_aux_mod_aux_mod_v_main_~i~0_37_46_39_111_139_161_80_100 Int) (aux_div_aux_mod_v_main_~i~0_37_46_39 Int) (aux_mod_aux_div_aux_mod_aux_mod_aux_mod_aux_mod_aux_mod_v_main_~i~0_37_46_39_111_139_161_80_100 Int) (aux_mod_aux_mod_v_main_~n~0_BEFORE_RETURN_4_44_55 Int) (aux_div_aux_mod_aux_mod_v_main_~i~0_37_46_39_111 Int)) (let ((.cse12 (* 8589934592 aux_div_aux_div_aux_mod_aux_mod_aux_mod_v_main_~i~0_37_46_39_111_139_77)) (.cse3 (* aux_div_aux_mod_v_main_~i~0_37_46_39 2)) (.cse10 (* 8589934592 aux_div_aux_div_aux_mod_aux_mod_aux_mod_aux_mod_aux_mod_v_main_~i~0_37_46_39_111_139_161_80_100)) (.cse11 (* aux_mod_aux_div_aux_mod_aux_mod_aux_mod_aux_mod_aux_mod_v_main_~i~0_37_46_39_111_139_161_80_100 2)) (.cse13 (* aux_div_aux_mod_aux_mod_aux_mod_aux_mod_v_main_~i~0_37_46_39_111_139_161 4294967296))) (let ((.cse1 (+ .cse10 .cse11 aux_mod_aux_mod_aux_mod_aux_mod_aux_mod_aux_mod_v_main_~i~0_37_46_39_111_139_161_80 .cse13)) (.cse0 (* aux_mod_aux_div_aux_mod_aux_mod_aux_mod_v_main_~i~0_37_46_39_111_139_77 2)) (.cse4 (+ 2 .cse3)) (.cse2 (+ .cse10 .cse11 .cse12 aux_mod_aux_mod_aux_mod_aux_mod_aux_mod_aux_mod_v_main_~i~0_37_46_39_111_139_161_80 .cse13)) (.cse9 (+ (* 4294967296 aux_div_aux_mod_v_main_~n~0_BEFORE_RETURN_4_44_55) aux_mod_aux_mod_v_main_~n~0_BEFORE_RETURN_4_44_55)) (.cse5 (* aux_div_aux_mod_aux_mod_v_main_~i~0_37_46_39_111 4294967296)) (.cse6 (+ .cse10 .cse11 .cse12 aux_mod_aux_mod_aux_mod_aux_mod_aux_mod_aux_mod_v_main_~i~0_37_46_39_111_139_161_80 .cse13 4294967293)) (.cse7 (+ .cse10 .cse11 aux_mod_aux_mod_aux_mod_aux_mod_aux_mod_aux_mod_v_main_~i~0_37_46_39_111_139_161_80)) (.cse8 (+ aux_mod_aux_mod_v_main_~j~0_34_46_48 (* aux_div_aux_mod_v_main_~j~0_34_46_48 4294967296)))) (and (<= (+ 3 .cse0) .cse1) (< aux_mod_aux_mod_v_main_~j~0_34_46_48 4294967296) (< aux_mod_aux_div_aux_mod_aux_mod_aux_mod_aux_mod_aux_mod_v_main_~i~0_37_46_39_111_139_161_80_100 4294967296) (<= 0 aux_mod_aux_mod_v_main_~n~0_BEFORE_RETURN_4_44_55) (<= 0 aux_mod_aux_mod_aux_mod_aux_mod_aux_mod_aux_mod_v_main_~i~0_37_46_39_111_139_161_80) (< .cse2 (+ .cse3 4)) (not (= .cse2 .cse4)) (< .cse2 (+ .cse5 3)) (<= 0 aux_mod_aux_div_aux_mod_aux_mod_aux_mod_v_main_~i~0_37_46_39_111_139_77) (< aux_mod_aux_mod_aux_mod_aux_mod_aux_mod_aux_mod_v_main_~i~0_37_46_39_111_139_161_80 2) (< aux_mod_aux_div_aux_mod_aux_mod_aux_mod_v_main_~i~0_37_46_39_111_139_77 4294967296) (< .cse6 (+ .cse5 aux_mod_aux_mod_v_main_~n~0_BEFORE_RETURN_4_44_55)) (<= 3 .cse2) (< .cse1 (+ 5 .cse0)) (<= 0 .cse7) (<= 0 aux_mod_aux_mod_v_main_~j~0_34_46_48) (< .cse8 4294967299) (< .cse9 4294967296) (< aux_mod_aux_mod_v_main_~n~0_BEFORE_RETURN_4_44_55 4294967296) (<= .cse4 .cse2) (< .cse2 4294967299) (<= 0 aux_mod_aux_div_aux_mod_aux_mod_aux_mod_aux_mod_aux_mod_v_main_~i~0_37_46_39_111_139_161_80_100) (<= (+ aux_mod_aux_div_aux_mod_aux_mod_aux_mod_v_main_~i~0_37_46_39_111_139_77 3) .cse8) (< 0 .cse9) (<= .cse5 .cse6) (<= aux_mod_aux_div_aux_mod_aux_mod_aux_mod_aux_mod_aux_mod_v_main_~i~0_37_46_39_111_139_161_80_100 aux_mod_aux_mod_v_main_~j~0_34_46_48) (< .cse7 4294967296) (<= 3 .cse8))))) (<= (mod (div (mod c_main_~i~0 4294967296) 2) 4294967296) (mod c_main_~j~0 4294967296))) is different from true [2022-01-31 23:30:25,072 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 23:30:25,073 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1140213713] [2022-01-31 23:30:25,073 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [1140213713] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 23:30:25,073 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 23:30:25,073 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2022-01-31 23:30:25,073 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [290544848] [2022-01-31 23:30:25,073 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 23:30:25,073 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-01-31 23:30:25,073 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 23:30:25,074 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-01-31 23:30:25,074 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=240, Unknown=23, NotChecked=266, Total=600 [2022-01-31 23:30:25,074 INFO L87 Difference]: Start difference. First operand 41 states and 44 transitions. Second operand has 21 states, 19 states have (on average 1.1578947368421053) internal successors, (22), 14 states have internal predecessors, (22), 5 states have call successors, (5), 5 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-01-31 23:30:27,076 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-01-31 23:30:35,568 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.98s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-31 23:30:37,584 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-31 23:30:39,677 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-31 23:31:20,413 WARN L228 SmtUtils]: Spent 36.34s on a formula simplification that was a NOOP. DAG size: 58 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-01-31 23:31:22,419 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-31 23:31:24,546 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.13s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-31 23:31:26,714 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-31 23:31:28,933 WARN L838 $PredicateComparison]: unable to prove that (and (= |c_#NULL.base| |c_old(#NULL.base)|) (<= c_~SIZE~0 20000001) (<= c_main_~n~0 (+ (* (div c_main_~n~0 4294967296) 4294967296) 20000001)) (< 0 (mod c_main_~n~0 4294967296)) (<= 20000001 c_~SIZE~0) (= |c___VERIFIER_assert_#in~cond| 1) (exists ((aux_div_aux_div_aux_mod_aux_mod_aux_mod_v_main_~i~0_37_46_39_111_139_77 Int) (aux_mod_aux_div_aux_mod_aux_mod_aux_mod_v_main_~i~0_37_46_39_111_139_77 Int) (aux_mod_aux_mod_aux_mod_aux_mod_v_main_~i~0_37_46_39_111_139 Int) (aux_div_aux_mod_aux_mod_v_main_~i~0_37_46_39_111 Int) (aux_mod_v_main_~j~0_34_46 Int) (aux_div_aux_mod_v_main_~i~0_37_46_39 Int)) (let ((.cse5 (* 8589934592 aux_div_aux_div_aux_mod_aux_mod_aux_mod_v_main_~i~0_37_46_39_111_139_77)) (.cse3 (* aux_mod_aux_div_aux_mod_aux_mod_aux_mod_v_main_~i~0_37_46_39_111_139_77 2))) (let ((.cse6 (+ .cse5 aux_mod_aux_mod_aux_mod_aux_mod_v_main_~i~0_37_46_39_111_139 .cse3 4294967296)) (.cse1 (* aux_div_aux_mod_aux_mod_v_main_~i~0_37_46_39_111 4294967296)) (.cse4 (* aux_div_aux_mod_v_main_~i~0_37_46_39 2)) (.cse0 (+ .cse5 aux_mod_aux_mod_aux_mod_aux_mod_v_main_~i~0_37_46_39_111_139 .cse3))) (and (< .cse0 .cse1) (<= 0 aux_mod_aux_mod_aux_mod_aux_mod_v_main_~i~0_37_46_39_111_139) (let ((.cse2 (<= (mod (div (mod (+ 3 aux_mod_aux_mod_aux_mod_aux_mod_v_main_~i~0_37_46_39_111_139 .cse3) 4294967296) 2) 4294967296) (mod (+ 3 aux_mod_v_main_~j~0_34_46) 4294967296)))) (or (and .cse2 (= |c___VERIFIER_assert_#in~cond| 1)) (and (not .cse2) (= |c___VERIFIER_assert_#in~cond| 0)))) (< .cse0 (+ .cse4 1)) (<= 0 aux_mod_aux_div_aux_mod_aux_mod_aux_mod_v_main_~i~0_37_46_39_111_139_77) (not (= (+ .cse5 aux_mod_aux_mod_aux_mod_aux_mod_v_main_~i~0_37_46_39_111_139 .cse3 (* aux_div_aux_mod_v_main_~i~0_37_46_39 (- 2)) 1) 0)) (< aux_mod_aux_div_aux_mod_aux_mod_aux_mod_v_main_~i~0_37_46_39_111_139_77 4294967296) (<= .cse1 .cse6) (<= aux_mod_aux_div_aux_mod_aux_mod_aux_mod_v_main_~i~0_37_46_39_111_139_77 aux_mod_v_main_~j~0_34_46) (< .cse6 (+ .cse1 (mod c_main_~n~0 4294967296))) (< aux_mod_v_main_~j~0_34_46 4294967296) (<= .cse4 (+ .cse5 aux_mod_aux_mod_aux_mod_aux_mod_v_main_~i~0_37_46_39_111_139 .cse3 1)) (<= 0 .cse0) (< aux_mod_aux_mod_aux_mod_aux_mod_v_main_~i~0_37_46_39_111_139 2) (< .cse0 4294967296) (<= 0 aux_mod_v_main_~j~0_34_46))))) (= |c_#NULL.offset| |c_old(#NULL.offset)|) (= |c_old(~SIZE~0)| c_~SIZE~0)) is different from false [2022-01-31 23:31:31,053 WARN L838 $PredicateComparison]: unable to prove that (and (= |c___VERIFIER_assert_#in~cond| c___VERIFIER_assert_~cond) (<= c_main_~n~0 (+ (* (div c_main_~n~0 4294967296) 4294967296) 20000001)) (< 0 (mod c_main_~n~0 4294967296)) (= |c___VERIFIER_assert_#in~cond| 1) (exists ((aux_div_aux_div_aux_mod_aux_mod_aux_mod_v_main_~i~0_37_46_39_111_139_77 Int) (aux_mod_aux_div_aux_mod_aux_mod_aux_mod_v_main_~i~0_37_46_39_111_139_77 Int) (aux_mod_aux_mod_aux_mod_aux_mod_v_main_~i~0_37_46_39_111_139 Int) (aux_div_aux_mod_aux_mod_v_main_~i~0_37_46_39_111 Int) (aux_mod_v_main_~j~0_34_46 Int) (aux_div_aux_mod_v_main_~i~0_37_46_39 Int)) (let ((.cse5 (* 8589934592 aux_div_aux_div_aux_mod_aux_mod_aux_mod_v_main_~i~0_37_46_39_111_139_77)) (.cse3 (* aux_mod_aux_div_aux_mod_aux_mod_aux_mod_v_main_~i~0_37_46_39_111_139_77 2))) (let ((.cse6 (+ .cse5 aux_mod_aux_mod_aux_mod_aux_mod_v_main_~i~0_37_46_39_111_139 .cse3 4294967296)) (.cse1 (* aux_div_aux_mod_aux_mod_v_main_~i~0_37_46_39_111 4294967296)) (.cse4 (* aux_div_aux_mod_v_main_~i~0_37_46_39 2)) (.cse0 (+ .cse5 aux_mod_aux_mod_aux_mod_aux_mod_v_main_~i~0_37_46_39_111_139 .cse3))) (and (< .cse0 .cse1) (<= 0 aux_mod_aux_mod_aux_mod_aux_mod_v_main_~i~0_37_46_39_111_139) (let ((.cse2 (<= (mod (div (mod (+ 3 aux_mod_aux_mod_aux_mod_aux_mod_v_main_~i~0_37_46_39_111_139 .cse3) 4294967296) 2) 4294967296) (mod (+ 3 aux_mod_v_main_~j~0_34_46) 4294967296)))) (or (and .cse2 (= |c___VERIFIER_assert_#in~cond| 1)) (and (not .cse2) (= |c___VERIFIER_assert_#in~cond| 0)))) (< .cse0 (+ .cse4 1)) (<= 0 aux_mod_aux_div_aux_mod_aux_mod_aux_mod_v_main_~i~0_37_46_39_111_139_77) (not (= (+ .cse5 aux_mod_aux_mod_aux_mod_aux_mod_v_main_~i~0_37_46_39_111_139 .cse3 (* aux_div_aux_mod_v_main_~i~0_37_46_39 (- 2)) 1) 0)) (< aux_mod_aux_div_aux_mod_aux_mod_aux_mod_v_main_~i~0_37_46_39_111_139_77 4294967296) (<= .cse1 .cse6) (<= aux_mod_aux_div_aux_mod_aux_mod_aux_mod_v_main_~i~0_37_46_39_111_139_77 aux_mod_v_main_~j~0_34_46) (< .cse6 (+ .cse1 (mod c_main_~n~0 4294967296))) (< aux_mod_v_main_~j~0_34_46 4294967296) (<= .cse4 (+ .cse5 aux_mod_aux_mod_aux_mod_aux_mod_v_main_~i~0_37_46_39_111_139 .cse3 1)) (<= 0 .cse0) (< aux_mod_aux_mod_aux_mod_aux_mod_v_main_~i~0_37_46_39_111_139 2) (< .cse0 4294967296) (<= 0 aux_mod_v_main_~j~0_34_46)))))) is different from false [2022-01-31 23:31:49,965 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-31 23:31:52,184 WARN L838 $PredicateComparison]: unable to prove that (and (= |c_#NULL.base| |c_old(#NULL.base)|) (not (= c___VERIFIER_assert_~cond 0)) (= |c___VERIFIER_assert_#in~cond| c___VERIFIER_assert_~cond) (<= c_main_~n~0 (+ (* (div c_main_~n~0 4294967296) 4294967296) 20000001)) (< 0 (mod c_main_~n~0 4294967296)) (= |c___VERIFIER_assert_#in~cond| 1) (exists ((aux_div_aux_div_aux_mod_aux_mod_aux_mod_v_main_~i~0_37_46_39_111_139_77 Int) (aux_mod_aux_div_aux_mod_aux_mod_aux_mod_v_main_~i~0_37_46_39_111_139_77 Int) (aux_mod_aux_mod_aux_mod_aux_mod_v_main_~i~0_37_46_39_111_139 Int) (aux_div_aux_mod_aux_mod_v_main_~i~0_37_46_39_111 Int) (aux_mod_v_main_~j~0_34_46 Int) (aux_div_aux_mod_v_main_~i~0_37_46_39 Int)) (let ((.cse5 (* 8589934592 aux_div_aux_div_aux_mod_aux_mod_aux_mod_v_main_~i~0_37_46_39_111_139_77)) (.cse3 (* aux_mod_aux_div_aux_mod_aux_mod_aux_mod_v_main_~i~0_37_46_39_111_139_77 2))) (let ((.cse6 (+ .cse5 aux_mod_aux_mod_aux_mod_aux_mod_v_main_~i~0_37_46_39_111_139 .cse3 4294967296)) (.cse1 (* aux_div_aux_mod_aux_mod_v_main_~i~0_37_46_39_111 4294967296)) (.cse4 (* aux_div_aux_mod_v_main_~i~0_37_46_39 2)) (.cse0 (+ .cse5 aux_mod_aux_mod_aux_mod_aux_mod_v_main_~i~0_37_46_39_111_139 .cse3))) (and (< .cse0 .cse1) (<= 0 aux_mod_aux_mod_aux_mod_aux_mod_v_main_~i~0_37_46_39_111_139) (let ((.cse2 (<= (mod (div (mod (+ 3 aux_mod_aux_mod_aux_mod_aux_mod_v_main_~i~0_37_46_39_111_139 .cse3) 4294967296) 2) 4294967296) (mod (+ 3 aux_mod_v_main_~j~0_34_46) 4294967296)))) (or (and .cse2 (= |c___VERIFIER_assert_#in~cond| 1)) (and (not .cse2) (= |c___VERIFIER_assert_#in~cond| 0)))) (< .cse0 (+ .cse4 1)) (<= 0 aux_mod_aux_div_aux_mod_aux_mod_aux_mod_v_main_~i~0_37_46_39_111_139_77) (not (= (+ .cse5 aux_mod_aux_mod_aux_mod_aux_mod_v_main_~i~0_37_46_39_111_139 .cse3 (* aux_div_aux_mod_v_main_~i~0_37_46_39 (- 2)) 1) 0)) (< aux_mod_aux_div_aux_mod_aux_mod_aux_mod_v_main_~i~0_37_46_39_111_139_77 4294967296) (<= .cse1 .cse6) (<= aux_mod_aux_div_aux_mod_aux_mod_aux_mod_v_main_~i~0_37_46_39_111_139_77 aux_mod_v_main_~j~0_34_46) (< .cse6 (+ .cse1 (mod c_main_~n~0 4294967296))) (< aux_mod_v_main_~j~0_34_46 4294967296) (<= .cse4 (+ .cse5 aux_mod_aux_mod_aux_mod_aux_mod_v_main_~i~0_37_46_39_111_139 .cse3 1)) (<= 0 .cse0) (< aux_mod_aux_mod_aux_mod_aux_mod_v_main_~i~0_37_46_39_111_139 2) (< .cse0 4294967296) (<= 0 aux_mod_v_main_~j~0_34_46))))) (= |c_#NULL.offset| |c_old(#NULL.offset)|) (= |c_old(~SIZE~0)| c_~SIZE~0)) is different from false [2022-01-31 23:31:54,302 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse1 (mod (+ c_main_~i~0 4294967293) 4294967296))) (and (or (<= (+ (* (div c_main_~j~0 4294967296) 8589934592) c_main_~i~0) (let ((.cse0 (div c_main_~i~0 4294967296))) (+ (* .cse0 4294967296) (* (div (div (+ c_main_~i~0 (* .cse0 (- 4294967296))) 2) 4294967296) 8589934592) (* 2 c_main_~j~0)))) (and (<= c_main_~i~0 3) (<= 3 c_main_~i~0))) (< .cse1 (mod c_main_~n~0 4294967296)) (<= (mod (div .cse1 2) 4294967296) (mod c_main_~j~0 4294967296)))) is different from true [2022-01-31 23:31:56,307 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-31 23:31:58,410 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.10s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-31 23:32:15,468 WARN L228 SmtUtils]: Spent 14.82s on a formula simplification. DAG size of input: 30 DAG size of output: 29 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-01-31 23:32:17,471 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-31 23:32:28,062 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-31 23:32:30,928 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.87s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-31 23:32:33,040 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.11s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-31 23:32:35,237 WARN L838 $PredicateComparison]: unable to prove that (and (= |c_#NULL.base| |c_old(#NULL.base)|) (< 0 (mod c_main_~n~0 4294967296)) (exists ((aux_div_aux_div_aux_mod_aux_mod_aux_mod_v_main_~i~0_37_46_39_111_139_77 Int) (aux_mod_aux_div_aux_mod_aux_mod_aux_mod_v_main_~i~0_37_46_39_111_139_77 Int) (aux_mod_aux_mod_aux_mod_aux_mod_v_main_~i~0_37_46_39_111_139 Int) (aux_div_aux_mod_aux_mod_v_main_~i~0_37_46_39_111 Int) (aux_mod_v_main_~j~0_34_46 Int) (aux_div_aux_mod_v_main_~i~0_37_46_39 Int)) (let ((.cse5 (* 8589934592 aux_div_aux_div_aux_mod_aux_mod_aux_mod_v_main_~i~0_37_46_39_111_139_77)) (.cse3 (* aux_mod_aux_div_aux_mod_aux_mod_aux_mod_v_main_~i~0_37_46_39_111_139_77 2))) (let ((.cse6 (+ .cse5 aux_mod_aux_mod_aux_mod_aux_mod_v_main_~i~0_37_46_39_111_139 .cse3 4294967296)) (.cse1 (* aux_div_aux_mod_aux_mod_v_main_~i~0_37_46_39_111 4294967296)) (.cse4 (* aux_div_aux_mod_v_main_~i~0_37_46_39 2)) (.cse0 (+ .cse5 aux_mod_aux_mod_aux_mod_aux_mod_v_main_~i~0_37_46_39_111_139 .cse3))) (and (< .cse0 .cse1) (<= 0 aux_mod_aux_mod_aux_mod_aux_mod_v_main_~i~0_37_46_39_111_139) (let ((.cse2 (<= (mod (div (mod (+ 3 aux_mod_aux_mod_aux_mod_aux_mod_v_main_~i~0_37_46_39_111_139 .cse3) 4294967296) 2) 4294967296) (mod (+ 3 aux_mod_v_main_~j~0_34_46) 4294967296)))) (or (and .cse2 (= |c___VERIFIER_assert_#in~cond| 1)) (and (not .cse2) (= |c___VERIFIER_assert_#in~cond| 0)))) (< .cse0 (+ .cse4 1)) (<= 0 aux_mod_aux_div_aux_mod_aux_mod_aux_mod_v_main_~i~0_37_46_39_111_139_77) (not (= (+ .cse5 aux_mod_aux_mod_aux_mod_aux_mod_v_main_~i~0_37_46_39_111_139 .cse3 (* aux_div_aux_mod_v_main_~i~0_37_46_39 (- 2)) 1) 0)) (< aux_mod_aux_div_aux_mod_aux_mod_aux_mod_v_main_~i~0_37_46_39_111_139_77 4294967296) (<= .cse1 .cse6) (<= aux_mod_aux_div_aux_mod_aux_mod_aux_mod_v_main_~i~0_37_46_39_111_139_77 aux_mod_v_main_~j~0_34_46) (< .cse6 (+ .cse1 (mod c_main_~n~0 4294967296))) (< aux_mod_v_main_~j~0_34_46 4294967296) (<= .cse4 (+ .cse5 aux_mod_aux_mod_aux_mod_aux_mod_v_main_~i~0_37_46_39_111_139 .cse3 1)) (<= 0 .cse0) (< aux_mod_aux_mod_aux_mod_aux_mod_v_main_~i~0_37_46_39_111_139 2) (< .cse0 4294967296) (<= 0 aux_mod_v_main_~j~0_34_46))))) (= |c_#NULL.offset| |c_old(#NULL.offset)|) (= |c_old(~SIZE~0)| c_~SIZE~0)) is different from false [2022-01-31 23:32:37,243 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-31 23:32:39,350 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.11s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-31 23:32:43,571 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-31 23:32:45,677 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.11s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-31 23:32:47,812 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-31 23:32:49,926 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-31 23:32:52,046 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-31 23:32:54,152 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-31 23:32:56,261 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-31 23:33:17,407 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-31 23:33:19,522 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-31 23:33:21,655 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-31 23:33:23,791 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.13s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-31 23:33:25,933 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.14s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-31 23:33:28,070 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-31 23:33:32,309 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-31 23:33:34,420 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-31 23:33:36,528 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-31 23:33:36,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 23:33:36,628 INFO L93 Difference]: Finished difference Result 62 states and 68 transitions. [2022-01-31 23:33:36,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-01-31 23:33:36,628 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 19 states have (on average 1.1578947368421053) internal successors, (22), 14 states have internal predecessors, (22), 5 states have call successors, (5), 5 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 30 [2022-01-31 23:33:36,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 23:33:36,629 INFO L225 Difference]: With dead ends: 62 [2022-01-31 23:33:36,629 INFO L226 Difference]: Without dead ends: 60 [2022-01-31 23:33:36,630 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 7 SyntacticMatches, 4 SemanticMatches, 38 ConstructedPredicates, 12 IntricatePredicates, 0 DeprecatedPredicates, 172 ImplicationChecksByTransitivity, 187.2s TimeCoverageRelationStatistics Valid=148, Invalid=610, Unknown=46, NotChecked=756, Total=1560 [2022-01-31 23:33:36,630 INFO L933 BasicCegarLoop]: 12 mSDtfsCounter, 27 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 27 mSolverCounterUnsat, 31 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 64.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 74 SdHoareTripleChecker+Invalid, 311 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 31 IncrementalHoareTripleChecker+Unknown, 160 IncrementalHoareTripleChecker+Unchecked, 68.3s IncrementalHoareTripleChecker+Time [2022-01-31 23:33:36,631 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [27 Valid, 74 Invalid, 311 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 93 Invalid, 31 Unknown, 160 Unchecked, 68.3s Time] [2022-01-31 23:33:36,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2022-01-31 23:33:36,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 43. [2022-01-31 23:33:36,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 31 states have (on average 1.1935483870967742) internal successors, (37), 31 states have internal predecessors, (37), 6 states have call successors, (6), 6 states have call predecessors, (6), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-01-31 23:33:36,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 48 transitions. [2022-01-31 23:33:36,641 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 48 transitions. Word has length 30 [2022-01-31 23:33:36,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 23:33:36,641 INFO L470 AbstractCegarLoop]: Abstraction has 43 states and 48 transitions. [2022-01-31 23:33:36,641 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 19 states have (on average 1.1578947368421053) internal successors, (22), 14 states have internal predecessors, (22), 5 states have call successors, (5), 5 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-01-31 23:33:36,641 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 48 transitions. [2022-01-31 23:33:36,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-01-31 23:33:36,642 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 23:33:36,642 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 23:33:36,642 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-01-31 23:33:36,642 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 23:33:36,642 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 23:33:36,642 INFO L85 PathProgramCache]: Analyzing trace with hash -523098717, now seen corresponding path program 3 times [2022-01-31 23:33:36,642 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 23:33:36,642 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1392943731] [2022-01-31 23:33:36,642 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 23:33:36,905 INFO L236 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2022-01-31 23:33:36,905 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 23:33:36,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:33:37,306 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 23:33:37,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:33:37,333 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 23:34:06,984 WARN L228 SmtUtils]: Spent 29.64s on a formula simplification. DAG size of input: 87 DAG size of output: 76 (called from [L 183] de.uni_freiburg.informatik.ultimate.lib.acceleratedinterpolation.MetaTraceTransformer.getInductiveLoopInterpolants) [2022-01-31 23:34:09,265 WARN L860 $PredicateComparison]: unable to prove that (and (<= (mod (div (mod c_main_~i~0 4294967296) 2) 4294967296) (mod c_main_~j~0 4294967296)) (exists ((aux_div_v_main_~n~0_BEFORE_RETURN_5_44 Int) (aux_mod_aux_mod_v_main_~n~0_BEFORE_RETURN_5_44_113 Int) (aux_div_aux_mod_v_main_~n~0_BEFORE_RETURN_5_44_113 Int)) (let ((.cse1 (* aux_div_v_main_~n~0_BEFORE_RETURN_5_44 4294967296)) (.cse0 (+ aux_mod_aux_mod_v_main_~n~0_BEFORE_RETURN_5_44_113 (* 4294967296 aux_div_aux_mod_v_main_~n~0_BEFORE_RETURN_5_44_113)))) (and (<= 0 aux_mod_aux_mod_v_main_~n~0_BEFORE_RETURN_5_44_113) (<= aux_mod_aux_mod_v_main_~n~0_BEFORE_RETURN_5_44_113 20000001) (< .cse0 (+ .cse1 4294967296)) (< .cse1 .cse0))))) is different from true [2022-01-31 23:34:11,366 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 (mod (+ c_main_~i~0 4294967293) 4294967296))) (and (< .cse0 (mod c_main_~n~0 4294967296)) (<= (mod (div .cse0 2) 4294967296) (mod c_main_~j~0 4294967296)))) is different from true [2022-01-31 23:34:34,571 WARN L228 SmtUtils]: Spent 6.33s on a formula simplification that was a NOOP. DAG size: 18 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-01-31 23:34:47,228 WARN L838 $PredicateComparison]: unable to prove that (exists ((aux_div_aux_mod_v_main_~i~0_BEFORE_CALL_6_57_53 Int) (aux_mod_aux_div_aux_mod_aux_mod_v_main_~i~0_BEFORE_CALL_6_57_53_122_76 Int) (aux_mod_v_main_~n~0_BEFORE_CALL_6_42 Int) (aux_mod_v_main_~j~0_BEFORE_CALL_6_42 Int) (aux_div_aux_div_aux_mod_aux_mod_v_main_~i~0_BEFORE_CALL_6_57_53_122_76 Int) (aux_div_aux_mod_aux_mod_aux_mod_v_main_~i~0_BEFORE_CALL_6_57_53_122_73 Int)) (let ((.cse0 (* 2 aux_div_aux_mod_aux_mod_aux_mod_v_main_~i~0_BEFORE_CALL_6_57_53_122_73)) (.cse4 (* aux_mod_aux_div_aux_mod_aux_mod_v_main_~i~0_BEFORE_CALL_6_57_53_122_76 2))) (let ((.cse2 (* 4294967296 aux_div_aux_mod_v_main_~i~0_BEFORE_CALL_6_57_53)) (.cse1 (+ (* 8589934592 aux_div_aux_div_aux_mod_aux_mod_v_main_~i~0_BEFORE_CALL_6_57_53_122_76) .cse0 .cse4))) (and (< aux_mod_v_main_~n~0_BEFORE_CALL_6_42 4294967296) (< .cse0 3) (< .cse1 (+ aux_mod_v_main_~n~0_BEFORE_CALL_6_42 .cse2 1)) (< .cse1 4294967297) (< .cse1 (+ 4294967297 .cse2)) (<= 0 aux_mod_aux_div_aux_mod_aux_mod_v_main_~i~0_BEFORE_CALL_6_57_53_122_76) (<= 0 aux_mod_v_main_~n~0_BEFORE_CALL_6_42) (< aux_mod_v_main_~j~0_BEFORE_CALL_6_42 4294967296) (<= aux_mod_aux_div_aux_mod_aux_mod_v_main_~i~0_BEFORE_CALL_6_57_53_122_76 aux_mod_v_main_~j~0_BEFORE_CALL_6_42) (<= 0 aux_mod_v_main_~j~0_BEFORE_CALL_6_42) (let ((.cse3 (<= (mod (div (mod (+ 2 .cse0 .cse4) 4294967296) 2) 4294967296) (mod aux_mod_v_main_~j~0_BEFORE_CALL_6_42 4294967296)))) (or (and .cse3 (= |c___VERIFIER_assert_#in~cond| 1)) (and (not .cse3) (= |c___VERIFIER_assert_#in~cond| 0)))) (<= 1 .cse1) (<= (+ .cse2 1) .cse1) (<= 1 .cse0) (< aux_mod_aux_div_aux_mod_aux_mod_v_main_~i~0_BEFORE_CALL_6_57_53_122_76 4294967296))))) is different from false [2022-01-31 23:34:49,375 WARN L838 $PredicateComparison]: unable to prove that (exists ((aux_div_aux_mod_v_main_~i~0_51_46_39 Int) (aux_mod_v_main_~j~0_44_31 Int)) (let ((.cse0 (* 2 aux_div_aux_mod_v_main_~i~0_51_46_39))) (and (<= 0 aux_mod_v_main_~j~0_44_31) (<= (mod (div (mod (+ 4294967295 .cse0) 4294967296) 2) 4294967296) aux_mod_v_main_~j~0_44_31) (< .cse0 (+ (mod c_main_~n~0 4294967296) 1)) (let ((.cse1 (<= (mod (div (mod (+ 2 .cse0) 4294967296) 2) 4294967296) (mod aux_mod_v_main_~j~0_44_31 4294967296)))) (or (and .cse1 (= |c___VERIFIER_assert_#in~cond| 1)) (and (= |c___VERIFIER_assert_#in~cond| 0) (not .cse1)))) (< aux_mod_v_main_~j~0_44_31 4294967296) (<= 1 .cse0) (< .cse0 4294967297)))) is different from false [2022-01-31 23:34:51,476 WARN L838 $PredicateComparison]: unable to prove that (and (= |c___VERIFIER_assert_#in~cond| c___VERIFIER_assert_~cond) (exists ((aux_div_aux_mod_v_main_~i~0_51_46_39 Int) (aux_mod_v_main_~j~0_44_31 Int)) (let ((.cse0 (* 2 aux_div_aux_mod_v_main_~i~0_51_46_39))) (and (<= 0 aux_mod_v_main_~j~0_44_31) (<= (mod (div (mod (+ 4294967295 .cse0) 4294967296) 2) 4294967296) aux_mod_v_main_~j~0_44_31) (< .cse0 (+ (mod c_main_~n~0 4294967296) 1)) (let ((.cse1 (<= (mod (div (mod (+ 2 .cse0) 4294967296) 2) 4294967296) (mod aux_mod_v_main_~j~0_44_31 4294967296)))) (or (and .cse1 (= |c___VERIFIER_assert_#in~cond| 1)) (and (= |c___VERIFIER_assert_#in~cond| 0) (not .cse1)))) (< aux_mod_v_main_~j~0_44_31 4294967296) (<= 1 .cse0) (< .cse0 4294967297))))) is different from false [2022-01-31 23:34:53,584 WARN L838 $PredicateComparison]: unable to prove that (and (not (= c___VERIFIER_assert_~cond 0)) (= |c___VERIFIER_assert_#in~cond| c___VERIFIER_assert_~cond) (exists ((aux_div_aux_mod_v_main_~i~0_51_46_39 Int) (aux_mod_v_main_~j~0_44_31 Int)) (let ((.cse0 (* 2 aux_div_aux_mod_v_main_~i~0_51_46_39))) (and (<= 0 aux_mod_v_main_~j~0_44_31) (<= (mod (div (mod (+ 4294967295 .cse0) 4294967296) 2) 4294967296) aux_mod_v_main_~j~0_44_31) (< .cse0 (+ (mod c_main_~n~0 4294967296) 1)) (let ((.cse1 (<= (mod (div (mod (+ 2 .cse0) 4294967296) 2) 4294967296) (mod aux_mod_v_main_~j~0_44_31 4294967296)))) (or (and .cse1 (= |c___VERIFIER_assert_#in~cond| 1)) (and (= |c___VERIFIER_assert_#in~cond| 0) (not .cse1)))) (< aux_mod_v_main_~j~0_44_31 4294967296) (<= 1 .cse0) (< .cse0 4294967297))))) is different from false [2022-01-31 23:34:55,716 WARN L838 $PredicateComparison]: unable to prove that (and (<= (mod (div (mod c_main_~i~0 4294967296) 2) 4294967296) (mod c_main_~j~0 4294967296)) (exists ((aux_mod_v_main_~n~0_BEFORE_RETURN_6_44 Int) (aux_div_aux_mod_v_main_~i~0_51_46_39 Int) (aux_div_aux_mod_v_main_~j~0_44_31_42 Int) (aux_mod_aux_mod_v_main_~j~0_44_31_42 Int)) (let ((.cse1 (* 2 aux_div_aux_mod_v_main_~i~0_51_46_39)) (.cse0 (+ aux_mod_aux_mod_v_main_~j~0_44_31_42 (* 4294967296 aux_div_aux_mod_v_main_~j~0_44_31_42)))) (and (< aux_mod_aux_mod_v_main_~j~0_44_31_42 4294967296) (<= 0 aux_mod_aux_mod_v_main_~j~0_44_31_42) (< .cse0 4294967296) (< aux_mod_v_main_~n~0_BEFORE_RETURN_6_44 4294967296) (<= 0 .cse0) (<= (mod (div (mod (+ 2 .cse1) 4294967296) 2) 4294967296) aux_mod_aux_mod_v_main_~j~0_44_31_42) (<= 0 aux_mod_v_main_~n~0_BEFORE_RETURN_6_44) (<= 1 .cse1) (< .cse1 (+ aux_mod_v_main_~n~0_BEFORE_RETURN_6_44 1)) (< .cse1 4294967297) (<= (mod (div (mod (+ 4294967295 .cse1) 4294967296) 2) 4294967296) .cse0))))) is different from false [2022-01-31 23:34:57,814 WARN L860 $PredicateComparison]: unable to prove that (and (<= (mod (div (mod c_main_~i~0 4294967296) 2) 4294967296) (mod c_main_~j~0 4294967296)) (exists ((aux_mod_v_main_~n~0_BEFORE_RETURN_6_44 Int) (aux_div_aux_mod_v_main_~i~0_51_46_39 Int) (aux_div_aux_mod_v_main_~j~0_44_31_42 Int) (aux_mod_aux_mod_v_main_~j~0_44_31_42 Int)) (let ((.cse1 (* 2 aux_div_aux_mod_v_main_~i~0_51_46_39)) (.cse0 (+ aux_mod_aux_mod_v_main_~j~0_44_31_42 (* 4294967296 aux_div_aux_mod_v_main_~j~0_44_31_42)))) (and (< aux_mod_aux_mod_v_main_~j~0_44_31_42 4294967296) (<= 0 aux_mod_aux_mod_v_main_~j~0_44_31_42) (< .cse0 4294967296) (< aux_mod_v_main_~n~0_BEFORE_RETURN_6_44 4294967296) (<= 0 .cse0) (<= (mod (div (mod (+ 2 .cse1) 4294967296) 2) 4294967296) aux_mod_aux_mod_v_main_~j~0_44_31_42) (<= 0 aux_mod_v_main_~n~0_BEFORE_RETURN_6_44) (<= 1 .cse1) (< .cse1 (+ aux_mod_v_main_~n~0_BEFORE_RETURN_6_44 1)) (< .cse1 4294967297) (<= (mod (div (mod (+ 4294967295 .cse1) 4294967296) 2) 4294967296) .cse0))))) is different from true [2022-01-31 23:34:57,816 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 23:34:57,816 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1392943731] [2022-01-31 23:34:57,816 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [1392943731] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 23:34:57,816 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 23:34:57,816 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2022-01-31 23:34:57,816 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [42799465] [2022-01-31 23:34:57,816 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 23:34:57,816 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-01-31 23:34:57,817 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 23:34:57,817 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-01-31 23:34:57,817 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=225, Unknown=15, NotChecked=252, Total=552 [2022-01-31 23:34:57,817 INFO L87 Difference]: Start difference. First operand 43 states and 48 transitions. Second operand has 21 states, 20 states have (on average 1.1) internal successors, (22), 14 states have internal predecessors, (22), 5 states have call successors, (5), 5 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-01-31 23:34:59,873 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-31 23:35:02,021 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-31 23:35:04,954 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.93s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-31 23:35:07,112 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-31 23:35:09,210 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-31 23:35:11,315 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-31 23:35:19,780 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-31 23:35:21,891 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.11s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-31 23:35:23,998 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.11s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-31 23:35:26,097 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-31 23:35:28,191 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.09s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-31 23:35:30,285 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.09s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-31 23:35:32,377 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.09s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-31 23:35:34,473 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.10s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-31 23:35:36,570 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.10s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-31 23:35:38,668 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.10s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-31 23:35:40,888 WARN L838 $PredicateComparison]: unable to prove that (and (= |c_#NULL.base| |c_old(#NULL.base)|) (exists ((aux_div_aux_mod_v_main_~i~0_51_46_39 Int) (aux_mod_v_main_~j~0_44_31 Int)) (let ((.cse0 (* 2 aux_div_aux_mod_v_main_~i~0_51_46_39))) (and (<= 0 aux_mod_v_main_~j~0_44_31) (<= (mod (div (mod (+ 4294967295 .cse0) 4294967296) 2) 4294967296) aux_mod_v_main_~j~0_44_31) (< .cse0 (+ (mod c_main_~n~0 4294967296) 1)) (let ((.cse1 (<= (mod (div (mod (+ 2 .cse0) 4294967296) 2) 4294967296) (mod aux_mod_v_main_~j~0_44_31 4294967296)))) (or (and .cse1 (= |c___VERIFIER_assert_#in~cond| 1)) (and (= |c___VERIFIER_assert_#in~cond| 0) (not .cse1)))) (< aux_mod_v_main_~j~0_44_31 4294967296) (<= 1 .cse0) (< .cse0 4294967297)))) (= |c_#NULL.offset| |c_old(#NULL.offset)|) (= |c_old(~SIZE~0)| c_~SIZE~0)) is different from false [2022-01-31 23:35:42,916 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-31 23:35:45,081 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-31 23:35:47,223 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-31 23:35:49,332 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-31 23:35:51,433 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-31 23:35:53,527 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.09s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-31 23:35:55,631 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.10s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-31 23:35:57,731 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.10s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-31 23:35:59,792 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.06s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-31 23:36:01,890 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-31 23:36:04,023 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.13s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-31 23:36:06,156 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.13s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-31 23:36:08,309 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-31 23:36:10,413 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.10s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-31 23:36:10,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 23:36:10,415 INFO L93 Difference]: Finished difference Result 70 states and 78 transitions. [2022-01-31 23:36:10,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-01-31 23:36:10,540 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 1.1) internal successors, (22), 14 states have internal predecessors, (22), 5 states have call successors, (5), 5 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 30 [2022-01-31 23:36:10,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 23:36:10,540 INFO L225 Difference]: With dead ends: 70 [2022-01-31 23:36:10,540 INFO L226 Difference]: Without dead ends: 68 [2022-01-31 23:36:10,541 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 4 SyntacticMatches, 5 SemanticMatches, 35 ConstructedPredicates, 8 IntricatePredicates, 0 DeprecatedPredicates, 183 ImplicationChecksByTransitivity, 59.9s TimeCoverageRelationStatistics Valid=151, Invalid=675, Unknown=18, NotChecked=488, Total=1332 [2022-01-31 23:36:10,541 INFO L933 BasicCegarLoop]: 13 mSDtfsCounter, 38 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 132 mSolverCounterSat, 18 mSolverCounterUnsat, 29 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 61.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 335 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 132 IncrementalHoareTripleChecker+Invalid, 29 IncrementalHoareTripleChecker+Unknown, 156 IncrementalHoareTripleChecker+Unchecked, 63.5s IncrementalHoareTripleChecker+Time [2022-01-31 23:36:10,542 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [38 Valid, 62 Invalid, 335 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 132 Invalid, 29 Unknown, 156 Unchecked, 63.5s Time] [2022-01-31 23:36:10,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2022-01-31 23:36:10,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 65. [2022-01-31 23:36:10,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 47 states have (on average 1.1702127659574468) internal successors, (55), 48 states have internal predecessors, (55), 9 states have call successors, (9), 9 states have call predecessors, (9), 8 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) [2022-01-31 23:36:10,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 72 transitions. [2022-01-31 23:36:10,560 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 72 transitions. Word has length 30 [2022-01-31 23:36:10,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 23:36:10,561 INFO L470 AbstractCegarLoop]: Abstraction has 65 states and 72 transitions. [2022-01-31 23:36:10,561 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 1.1) internal successors, (22), 14 states have internal predecessors, (22), 5 states have call successors, (5), 5 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-01-31 23:36:10,561 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 72 transitions. [2022-01-31 23:36:10,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-01-31 23:36:10,561 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 23:36:10,561 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 23:36:10,562 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-01-31 23:36:10,562 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 23:36:10,562 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 23:36:10,562 INFO L85 PathProgramCache]: Analyzing trace with hash -465840415, now seen corresponding path program 4 times [2022-01-31 23:36:10,562 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 23:36:10,562 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [722837956] [2022-01-31 23:36:10,562 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 23:36:10,825 INFO L236 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2022-01-31 23:36:10,826 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 23:36:10,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:36:11,611 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 23:36:11,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:36:11,634 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 23:36:18,039 WARN L228 SmtUtils]: Spent 6.39s on a formula simplification. DAG size of input: 112 DAG size of output: 13 (called from [L 183] de.uni_freiburg.informatik.ultimate.lib.acceleratedinterpolation.MetaTraceTransformer.getInductiveLoopInterpolants) [2022-01-31 23:36:20,378 WARN L838 $PredicateComparison]: unable to prove that (and (<= (mod (div (mod c_main_~i~0 4294967296) 2) 4294967296) (mod c_main_~j~0 4294967296)) (exists ((aux_div_aux_mod_v_main_~n~0_BEFORE_RETURN_7_44_113 Int) (aux_div_v_main_~n~0_BEFORE_RETURN_7_44 Int) (aux_mod_aux_mod_v_main_~n~0_BEFORE_RETURN_7_44_113 Int)) (let ((.cse1 (* aux_div_v_main_~n~0_BEFORE_RETURN_7_44 4294967296)) (.cse0 (+ aux_mod_aux_mod_v_main_~n~0_BEFORE_RETURN_7_44_113 (* aux_div_aux_mod_v_main_~n~0_BEFORE_RETURN_7_44_113 4294967296)))) (and (< .cse0 (+ .cse1 4294967296)) (<= 0 aux_mod_aux_mod_v_main_~n~0_BEFORE_RETURN_7_44_113) (< .cse1 .cse0) (<= aux_mod_aux_mod_v_main_~n~0_BEFORE_RETURN_7_44_113 20000001))))) is different from false [2022-01-31 23:36:22,489 WARN L860 $PredicateComparison]: unable to prove that (and (<= (mod (div (mod c_main_~i~0 4294967296) 2) 4294967296) (mod c_main_~j~0 4294967296)) (exists ((aux_div_aux_mod_v_main_~n~0_BEFORE_RETURN_7_44_113 Int) (aux_div_v_main_~n~0_BEFORE_RETURN_7_44 Int) (aux_mod_aux_mod_v_main_~n~0_BEFORE_RETURN_7_44_113 Int)) (let ((.cse1 (* aux_div_v_main_~n~0_BEFORE_RETURN_7_44 4294967296)) (.cse0 (+ aux_mod_aux_mod_v_main_~n~0_BEFORE_RETURN_7_44_113 (* aux_div_aux_mod_v_main_~n~0_BEFORE_RETURN_7_44_113 4294967296)))) (and (< .cse0 (+ .cse1 4294967296)) (<= 0 aux_mod_aux_mod_v_main_~n~0_BEFORE_RETURN_7_44_113) (< .cse1 .cse0) (<= aux_mod_aux_mod_v_main_~n~0_BEFORE_RETURN_7_44_113 20000001))))) is different from true [2022-01-31 23:36:24,620 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 (mod (+ c_main_~i~0 4294967293) 4294967296))) (and (< .cse0 (mod c_main_~n~0 4294967296)) (<= (mod (div .cse0 2) 4294967296) (mod c_main_~j~0 4294967296)))) is different from true [2022-01-31 23:36:45,848 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (mod c_main_~n~0 4294967296)) (.cse1 (mod (+ c_main_~i~0 4294967293) 4294967296))) (and (< 0 .cse0) (< .cse1 .cse0) (= (mod c_main_~i~0 2) 0) (<= (mod (div .cse1 2) 4294967296) (mod c_main_~j~0 4294967296)))) is different from false [2022-01-31 23:37:15,539 WARN L838 $PredicateComparison]: unable to prove that (and (< 0 (mod c_main_~n~0 4294967296)) (exists ((aux_div_v_main_~i~0_65_22 Int) (aux_mod_v_main_~j~0_54_31 Int)) (let ((.cse2 (* 2 aux_div_v_main_~i~0_65_22))) (let ((.cse0 (mod (+ .cse2 4294967293) 4294967296))) (and (< aux_mod_v_main_~j~0_54_31 4294967296) (< .cse0 (mod c_main_~n~0 4294967296)) (let ((.cse1 (<= (mod (div (mod .cse2 4294967296) 2) 4294967296) (mod aux_mod_v_main_~j~0_54_31 4294967296)))) (or (and .cse1 (= |c___VERIFIER_assert_#in~cond| 1)) (and (= |c___VERIFIER_assert_#in~cond| 0) (not .cse1)))) (<= 0 aux_mod_v_main_~j~0_54_31) (<= (mod (div .cse0 2) 4294967296) aux_mod_v_main_~j~0_54_31)))))) is different from false [2022-01-31 23:37:17,661 WARN L838 $PredicateComparison]: unable to prove that (and (= |c___VERIFIER_assert_#in~cond| c___VERIFIER_assert_~cond) (< 0 (mod c_main_~n~0 4294967296)) (exists ((aux_div_v_main_~i~0_65_22 Int) (aux_mod_v_main_~j~0_54_31 Int)) (let ((.cse2 (* 2 aux_div_v_main_~i~0_65_22))) (let ((.cse0 (mod (+ .cse2 4294967293) 4294967296))) (and (< aux_mod_v_main_~j~0_54_31 4294967296) (< .cse0 (mod c_main_~n~0 4294967296)) (let ((.cse1 (<= (mod (div (mod .cse2 4294967296) 2) 4294967296) (mod aux_mod_v_main_~j~0_54_31 4294967296)))) (or (and .cse1 (= |c___VERIFIER_assert_#in~cond| 1)) (and (= |c___VERIFIER_assert_#in~cond| 0) (not .cse1)))) (<= 0 aux_mod_v_main_~j~0_54_31) (<= (mod (div .cse0 2) 4294967296) aux_mod_v_main_~j~0_54_31)))))) is different from false [2022-01-31 23:37:19,776 WARN L838 $PredicateComparison]: unable to prove that (and (not (= c___VERIFIER_assert_~cond 0)) (= |c___VERIFIER_assert_#in~cond| c___VERIFIER_assert_~cond) (< 0 (mod c_main_~n~0 4294967296)) (exists ((aux_div_v_main_~i~0_65_22 Int) (aux_mod_v_main_~j~0_54_31 Int)) (let ((.cse2 (* 2 aux_div_v_main_~i~0_65_22))) (let ((.cse0 (mod (+ .cse2 4294967293) 4294967296))) (and (< aux_mod_v_main_~j~0_54_31 4294967296) (< .cse0 (mod c_main_~n~0 4294967296)) (let ((.cse1 (<= (mod (div (mod .cse2 4294967296) 2) 4294967296) (mod aux_mod_v_main_~j~0_54_31 4294967296)))) (or (and .cse1 (= |c___VERIFIER_assert_#in~cond| 1)) (and (= |c___VERIFIER_assert_#in~cond| 0) (not .cse1)))) (<= 0 aux_mod_v_main_~j~0_54_31) (<= (mod (div .cse0 2) 4294967296) aux_mod_v_main_~j~0_54_31)))))) is different from false [2022-01-31 23:37:21,954 WARN L838 $PredicateComparison]: unable to prove that (and (exists ((aux_div_v_main_~i~0_65_22 Int) (aux_div_aux_mod_v_main_~n~0_BEFORE_RETURN_8_44_55 Int) (aux_div_aux_mod_v_main_~j~0_54_31_42 Int) (aux_mod_aux_mod_v_main_~n~0_BEFORE_RETURN_8_44_55 Int) (aux_mod_aux_mod_v_main_~j~0_54_31_42 Int)) (let ((.cse1 (* 2 aux_div_v_main_~i~0_65_22))) (let ((.cse0 (+ (* aux_div_aux_mod_v_main_~j~0_54_31_42 4294967296) aux_mod_aux_mod_v_main_~j~0_54_31_42)) (.cse2 (mod (+ .cse1 4294967293) 4294967296)) (.cse3 (+ (* aux_div_aux_mod_v_main_~n~0_BEFORE_RETURN_8_44_55 4294967296) aux_mod_aux_mod_v_main_~n~0_BEFORE_RETURN_8_44_55))) (and (< .cse0 4294967296) (<= (mod (div (mod .cse1 4294967296) 2) 4294967296) aux_mod_aux_mod_v_main_~j~0_54_31_42) (<= 0 .cse0) (<= (mod (div .cse2 2) 4294967296) .cse0) (< 0 aux_mod_aux_mod_v_main_~n~0_BEFORE_RETURN_8_44_55) (<= 0 .cse3) (< aux_mod_aux_mod_v_main_~n~0_BEFORE_RETURN_8_44_55 4294967296) (< .cse3 4294967296) (< aux_mod_aux_mod_v_main_~j~0_54_31_42 4294967296) (<= 0 aux_mod_aux_mod_v_main_~j~0_54_31_42) (< .cse2 .cse3))))) (<= (mod (div (mod c_main_~i~0 4294967296) 2) 4294967296) (mod c_main_~j~0 4294967296))) is different from false [2022-01-31 23:37:21,958 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 23:37:21,958 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [722837956] [2022-01-31 23:37:21,958 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [722837956] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 23:37:21,959 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 23:37:21,959 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2022-01-31 23:37:21,959 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1114544745] [2022-01-31 23:37:21,959 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 23:37:21,959 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-01-31 23:37:21,959 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 23:37:21,959 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-01-31 23:37:21,960 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=210, Unknown=27, NotChecked=252, Total=552 [2022-01-31 23:37:21,960 INFO L87 Difference]: Start difference. First operand 65 states and 72 transitions. Second operand has 21 states, 19 states have (on average 1.1578947368421053) internal successors, (22), 14 states have internal predecessors, (22), 5 states have call successors, (5), 5 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-01-31 23:37:26,235 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-31 23:37:28,348 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.11s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-31 23:37:30,459 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-31 23:37:36,842 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-31 23:37:38,958 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-31 23:37:41,061 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-31 23:37:43,162 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.10s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-31 23:37:45,268 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.11s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-31 23:37:47,365 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.10s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-31 23:38:02,285 WARN L228 SmtUtils]: Spent 8.45s on a formula simplification. DAG size of input: 28 DAG size of output: 27 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-01-31 23:38:04,288 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-31 23:38:06,400 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.11s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-31 23:38:08,502 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.10s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-31 23:38:10,608 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.11s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-31 23:38:12,713 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.10s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-31 23:38:14,821 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.11s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-31 23:38:16,931 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.11s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-31 23:38:19,035 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.10s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-31 23:38:21,250 WARN L838 $PredicateComparison]: unable to prove that (and (= |c_#NULL.base| |c_old(#NULL.base)|) (< 0 (mod c_main_~n~0 4294967296)) (exists ((aux_div_v_main_~i~0_65_22 Int) (aux_mod_v_main_~j~0_54_31 Int)) (let ((.cse2 (* 2 aux_div_v_main_~i~0_65_22))) (let ((.cse0 (mod (+ .cse2 4294967293) 4294967296))) (and (< aux_mod_v_main_~j~0_54_31 4294967296) (< .cse0 (mod c_main_~n~0 4294967296)) (let ((.cse1 (<= (mod (div (mod .cse2 4294967296) 2) 4294967296) (mod aux_mod_v_main_~j~0_54_31 4294967296)))) (or (and .cse1 (= |c___VERIFIER_assert_#in~cond| 1)) (and (= |c___VERIFIER_assert_#in~cond| 0) (not .cse1)))) (<= 0 aux_mod_v_main_~j~0_54_31) (<= (mod (div .cse0 2) 4294967296) aux_mod_v_main_~j~0_54_31))))) (= |c_#NULL.offset| |c_old(#NULL.offset)|) (= |c_old(~SIZE~0)| c_~SIZE~0)) is different from false [2022-01-31 23:38:23,287 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-31 23:38:33,965 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-31 23:38:36,097 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-31 23:38:38,220 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-31 23:38:38,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 23:38:38,330 INFO L93 Difference]: Finished difference Result 77 states and 85 transitions. [2022-01-31 23:38:38,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-01-31 23:38:38,330 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 19 states have (on average 1.1578947368421053) internal successors, (22), 14 states have internal predecessors, (22), 5 states have call successors, (5), 5 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 30 [2022-01-31 23:38:38,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 23:38:38,331 INFO L225 Difference]: With dead ends: 77 [2022-01-31 23:38:38,331 INFO L226 Difference]: Without dead ends: 75 [2022-01-31 23:38:38,332 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 7 SyntacticMatches, 2 SemanticMatches, 34 ConstructedPredicates, 8 IntricatePredicates, 0 DeprecatedPredicates, 150 ImplicationChecksByTransitivity, 96.4s TimeCoverageRelationStatistics Valid=145, Invalid=606, Unknown=37, NotChecked=472, Total=1260 [2022-01-31 23:38:38,332 INFO L933 BasicCegarLoop]: 11 mSDtfsCounter, 32 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 15 mSolverCounterUnsat, 21 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 42.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 283 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 21 IncrementalHoareTripleChecker+Unknown, 152 IncrementalHoareTripleChecker+Unchecked, 44.2s IncrementalHoareTripleChecker+Time [2022-01-31 23:38:38,332 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [32 Valid, 66 Invalid, 283 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 95 Invalid, 21 Unknown, 152 Unchecked, 44.2s Time] [2022-01-31 23:38:38,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2022-01-31 23:38:38,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 71. [2022-01-31 23:38:38,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 51 states have (on average 1.1568627450980393) internal successors, (59), 53 states have internal predecessors, (59), 10 states have call successors, (10), 10 states have call predecessors, (10), 9 states have return successors, (9), 7 states have call predecessors, (9), 9 states have call successors, (9) [2022-01-31 23:38:38,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 78 transitions. [2022-01-31 23:38:38,347 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 78 transitions. Word has length 30 [2022-01-31 23:38:38,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 23:38:38,348 INFO L470 AbstractCegarLoop]: Abstraction has 71 states and 78 transitions. [2022-01-31 23:38:38,348 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 19 states have (on average 1.1578947368421053) internal successors, (22), 14 states have internal predecessors, (22), 5 states have call successors, (5), 5 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-01-31 23:38:38,348 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 78 transitions. [2022-01-31 23:38:38,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-01-31 23:38:38,348 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 23:38:38,348 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 23:38:38,349 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-01-31 23:38:38,349 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 23:38:38,349 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 23:38:38,349 INFO L85 PathProgramCache]: Analyzing trace with hash 2075525116, now seen corresponding path program 5 times [2022-01-31 23:38:38,349 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 23:38:38,349 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [863697486] [2022-01-31 23:38:38,349 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 23:38:38,606 INFO L236 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2022-01-31 23:38:38,606 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 23:38:38,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:38:39,112 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 23:38:39,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:38:39,130 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 23:39:27,106 WARN L228 SmtUtils]: Spent 47.96s on a formula simplification. DAG size of input: 90 DAG size of output: 36 (called from [L 183] de.uni_freiburg.informatik.ultimate.lib.acceleratedinterpolation.MetaTraceTransformer.getInductiveLoopInterpolants) [2022-01-31 23:39:29,218 WARN L838 $PredicateComparison]: unable to prove that (and (or (= c_main_~i~0 0) (and (<= (mod (div (mod c_main_~i~0 4294967296) 2) 4294967296) (mod c_main_~j~0 4294967296)) (<= 0 (div (* c_main_~i~0 (- 3)) (- 9))) (= (mod (* c_main_~i~0 6) 9) 0) (< (mod (+ c_main_~i~0 4294967293) 4294967296) (mod c_main_~n~0 4294967296)))) (<= c_main_~n~0 (+ (* (div c_main_~n~0 4294967296) 4294967296) 20000001)) (= c_main_~j~0 0)) is different from false [2022-01-31 23:39:35,821 WARN L838 $PredicateComparison]: unable to prove that (and (<= (mod (div (mod c_main_~i~0 4294967296) 2) 4294967296) (mod c_main_~j~0 4294967296)) (exists ((aux_div_aux_mod_v_main_~n~0_BEFORE_RETURN_9_44_113 Int) (aux_div_v_main_~n~0_BEFORE_RETURN_9_44 Int) (aux_mod_aux_mod_v_main_~n~0_BEFORE_RETURN_9_44_113 Int)) (let ((.cse1 (* aux_div_v_main_~n~0_BEFORE_RETURN_9_44 4294967296)) (.cse0 (+ (* aux_div_aux_mod_v_main_~n~0_BEFORE_RETURN_9_44_113 4294967296) aux_mod_aux_mod_v_main_~n~0_BEFORE_RETURN_9_44_113))) (and (<= aux_mod_aux_mod_v_main_~n~0_BEFORE_RETURN_9_44_113 20000001) (< .cse0 (+ .cse1 4294967296)) (< .cse1 .cse0) (<= 0 aux_mod_aux_mod_v_main_~n~0_BEFORE_RETURN_9_44_113))))) is different from false [2022-01-31 23:39:37,932 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 (mod (+ c_main_~i~0 4294967293) 4294967296))) (and (< .cse0 (mod c_main_~n~0 4294967296)) (<= (mod (div .cse0 2) 4294967296) (mod c_main_~j~0 4294967296)))) is different from true [2022-01-31 23:39:40,063 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 (mod (+ c_main_~i~0 4294967293) 4294967296))) (and (not (= (mod c_main_~i~0 2) 0)) (<= (mod (div .cse0 2) 4294967296) (mod (+ c_main_~j~0 4294967293) 4294967296)) (< .cse0 (mod c_main_~n~0 4294967296)))) is different from true [2022-01-31 23:39:42,194 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 (mod (+ c_main_~i~0 4294967293) 4294967296)) (.cse1 (mod c_main_~n~0 4294967296))) (and (not (= (mod c_main_~i~0 2) 0)) (<= (mod (div .cse0 2) 4294967296) (mod (+ c_main_~j~0 4294967293) 4294967296)) (< 0 .cse1) (< .cse0 .cse1))) is different from true [2022-01-31 23:39:44,323 WARN L838 $PredicateComparison]: unable to prove that (exists ((aux_div_aux_mod_v_main_~i~0_BEFORE_CALL_10_58_54 Int) (aux_mod_aux_mod_v_main_~n~0_BEFORE_CALL_10_43_54 Int) (aux_mod_aux_mod_aux_mod_aux_mod_v_main_~i~0_BEFORE_CALL_10_58_54_62_143 Int) (aux_div_aux_div_aux_mod_aux_mod_aux_mod_v_main_~i~0_BEFORE_CALL_10_58_54_62_143_88 Int) (aux_div_aux_mod_aux_mod_v_main_~i~0_BEFORE_CALL_10_58_54_62 Int) (aux_mod_aux_div_aux_mod_aux_mod_aux_mod_v_main_~i~0_BEFORE_CALL_10_58_54_62_143_88 Int) (aux_div_aux_mod_v_main_~n~0_BEFORE_CALL_10_43_54 Int) (aux_mod_v_main_~j~0_BEFORE_CALL_10_58 Int)) (let ((.cse7 (* 8589934592 aux_div_aux_div_aux_mod_aux_mod_aux_mod_v_main_~i~0_BEFORE_CALL_10_58_54_62_143_88)) (.cse6 (* 2 aux_mod_aux_div_aux_mod_aux_mod_aux_mod_v_main_~i~0_BEFORE_CALL_10_58_54_62_143_88))) (let ((.cse0 (+ aux_mod_aux_mod_aux_mod_aux_mod_v_main_~i~0_BEFORE_CALL_10_58_54_62_143 .cse7 (* aux_div_aux_mod_v_main_~i~0_BEFORE_CALL_10_58_54 4294967296) .cse6)) (.cse3 (* aux_div_aux_mod_aux_mod_v_main_~i~0_BEFORE_CALL_10_58_54_62 2)) (.cse4 (+ aux_mod_aux_mod_aux_mod_aux_mod_v_main_~i~0_BEFORE_CALL_10_58_54_62_143 .cse7 .cse6 1)) (.cse2 (+ aux_mod_aux_mod_aux_mod_aux_mod_v_main_~i~0_BEFORE_CALL_10_58_54_62_143 .cse7 .cse6)) (.cse1 (+ (* aux_div_aux_mod_v_main_~n~0_BEFORE_CALL_10_43_54 4294967296) aux_mod_aux_mod_v_main_~n~0_BEFORE_CALL_10_43_54))) (and (<= 0 .cse0) (< aux_mod_aux_mod_v_main_~n~0_BEFORE_CALL_10_43_54 4294967296) (< 0 .cse1) (<= aux_mod_aux_div_aux_mod_aux_mod_aux_mod_v_main_~i~0_BEFORE_CALL_10_58_54_62_143_88 aux_mod_v_main_~j~0_BEFORE_CALL_10_58) (< .cse2 (+ .cse3 1)) (not (= .cse4 .cse3)) (< .cse0 aux_mod_aux_mod_v_main_~n~0_BEFORE_CALL_10_43_54) (< aux_mod_aux_mod_aux_mod_aux_mod_v_main_~i~0_BEFORE_CALL_10_58_54_62_143 2) (< .cse0 4294967296) (<= 0 aux_mod_v_main_~j~0_BEFORE_CALL_10_58) (< aux_mod_aux_div_aux_mod_aux_mod_aux_mod_v_main_~i~0_BEFORE_CALL_10_58_54_62_143_88 4294967296) (<= 0 aux_mod_aux_mod_aux_mod_aux_mod_v_main_~i~0_BEFORE_CALL_10_58_54_62_143) (<= .cse3 .cse4) (< .cse2 4294967296) (<= 0 .cse2) (< aux_mod_v_main_~j~0_BEFORE_CALL_10_58 4294967296) (<= 0 aux_mod_aux_div_aux_mod_aux_mod_aux_mod_v_main_~i~0_BEFORE_CALL_10_58_54_62_143_88) (< .cse1 4294967296) (let ((.cse5 (<= (mod (div (mod (+ aux_mod_aux_mod_aux_mod_aux_mod_v_main_~i~0_BEFORE_CALL_10_58_54_62_143 3 .cse6) 4294967296) 2) 4294967296) (mod (+ 3 aux_mod_v_main_~j~0_BEFORE_CALL_10_58) 4294967296)))) (or (and .cse5 (= |c___VERIFIER_assert_#in~cond| 1)) (and (= |c___VERIFIER_assert_#in~cond| 0) (not .cse5)))) (<= 0 aux_mod_aux_mod_v_main_~n~0_BEFORE_CALL_10_43_54))))) is different from false [2022-01-31 23:39:46,454 WARN L838 $PredicateComparison]: unable to prove that (and (< 0 (mod c_main_~n~0 4294967296)) (exists ((aux_div_aux_mod_aux_mod_aux_mod_v_main_~i~0_79_46_33_111_62 Int) (aux_div_aux_div_aux_mod_v_main_~i~0_79_46_33_53 Int) (aux_mod_aux_mod_aux_mod_aux_mod_v_main_~i~0_79_46_33_111_62 Int) (aux_mod_v_main_~j~0_65_46 Int) (aux_mod_aux_div_aux_mod_v_main_~i~0_79_46_33_53 Int) (aux_div_aux_mod_aux_mod_v_main_~i~0_79_46_33_111 Int)) (let ((.cse6 (* aux_div_aux_mod_aux_mod_v_main_~i~0_79_46_33_111 4294967296)) (.cse4 (* 2 aux_div_aux_mod_aux_mod_aux_mod_v_main_~i~0_79_46_33_111_62))) (let ((.cse0 (+ .cse4 aux_mod_aux_mod_aux_mod_aux_mod_v_main_~i~0_79_46_33_111_62)) (.cse5 (+ (* aux_div_aux_div_aux_mod_v_main_~i~0_79_46_33_53 8589934592) .cse6 .cse4 aux_mod_aux_mod_aux_mod_aux_mod_v_main_~i~0_79_46_33_111_62)) (.cse2 (* 2 aux_mod_aux_div_aux_mod_v_main_~i~0_79_46_33_53)) (.cse1 (+ .cse6 .cse4 aux_mod_aux_mod_aux_mod_aux_mod_v_main_~i~0_79_46_33_111_62))) (and (<= aux_mod_aux_div_aux_mod_v_main_~i~0_79_46_33_53 aux_mod_v_main_~j~0_65_46) (< .cse0 (+ (mod c_main_~n~0 4294967296) 1)) (< aux_mod_aux_div_aux_mod_v_main_~i~0_79_46_33_53 4294967296) (<= 1 .cse0) (< .cse1 (+ .cse2 3)) (<= 0 aux_mod_aux_div_aux_mod_v_main_~i~0_79_46_33_53) (let ((.cse3 (<= (mod (div (mod (+ 2 .cse4 aux_mod_aux_mod_aux_mod_aux_mod_v_main_~i~0_79_46_33_111_62) 4294967296) 2) 4294967296) (mod (+ 3 aux_mod_v_main_~j~0_65_46) 4294967296)))) (or (and (not .cse3) (= |c___VERIFIER_assert_#in~cond| 0)) (and .cse3 (= |c___VERIFIER_assert_#in~cond| 1)))) (< aux_mod_aux_mod_aux_mod_aux_mod_v_main_~i~0_79_46_33_111_62 2) (< .cse0 4294967297) (<= 0 aux_mod_aux_mod_aux_mod_aux_mod_v_main_~i~0_79_46_33_111_62) (<= 1 .cse5) (< .cse5 4294967297) (not (= aux_mod_aux_mod_aux_mod_aux_mod_v_main_~i~0_79_46_33_111_62 0)) (< aux_mod_v_main_~j~0_65_46 4294967296) (<= 0 aux_mod_v_main_~j~0_65_46) (<= (+ .cse2 1) .cse1)))))) is different from false [2022-01-31 23:39:48,580 WARN L838 $PredicateComparison]: unable to prove that (and (= |c___VERIFIER_assert_#in~cond| c___VERIFIER_assert_~cond) (< 0 (mod c_main_~n~0 4294967296)) (exists ((aux_div_aux_mod_aux_mod_aux_mod_v_main_~i~0_79_46_33_111_62 Int) (aux_div_aux_div_aux_mod_v_main_~i~0_79_46_33_53 Int) (aux_mod_aux_mod_aux_mod_aux_mod_v_main_~i~0_79_46_33_111_62 Int) (aux_mod_v_main_~j~0_65_46 Int) (aux_mod_aux_div_aux_mod_v_main_~i~0_79_46_33_53 Int) (aux_div_aux_mod_aux_mod_v_main_~i~0_79_46_33_111 Int)) (let ((.cse6 (* aux_div_aux_mod_aux_mod_v_main_~i~0_79_46_33_111 4294967296)) (.cse4 (* 2 aux_div_aux_mod_aux_mod_aux_mod_v_main_~i~0_79_46_33_111_62))) (let ((.cse0 (+ .cse4 aux_mod_aux_mod_aux_mod_aux_mod_v_main_~i~0_79_46_33_111_62)) (.cse5 (+ (* aux_div_aux_div_aux_mod_v_main_~i~0_79_46_33_53 8589934592) .cse6 .cse4 aux_mod_aux_mod_aux_mod_aux_mod_v_main_~i~0_79_46_33_111_62)) (.cse2 (* 2 aux_mod_aux_div_aux_mod_v_main_~i~0_79_46_33_53)) (.cse1 (+ .cse6 .cse4 aux_mod_aux_mod_aux_mod_aux_mod_v_main_~i~0_79_46_33_111_62))) (and (<= aux_mod_aux_div_aux_mod_v_main_~i~0_79_46_33_53 aux_mod_v_main_~j~0_65_46) (< .cse0 (+ (mod c_main_~n~0 4294967296) 1)) (< aux_mod_aux_div_aux_mod_v_main_~i~0_79_46_33_53 4294967296) (<= 1 .cse0) (< .cse1 (+ .cse2 3)) (<= 0 aux_mod_aux_div_aux_mod_v_main_~i~0_79_46_33_53) (let ((.cse3 (<= (mod (div (mod (+ 2 .cse4 aux_mod_aux_mod_aux_mod_aux_mod_v_main_~i~0_79_46_33_111_62) 4294967296) 2) 4294967296) (mod (+ 3 aux_mod_v_main_~j~0_65_46) 4294967296)))) (or (and (not .cse3) (= |c___VERIFIER_assert_#in~cond| 0)) (and .cse3 (= |c___VERIFIER_assert_#in~cond| 1)))) (< aux_mod_aux_mod_aux_mod_aux_mod_v_main_~i~0_79_46_33_111_62 2) (< .cse0 4294967297) (<= 0 aux_mod_aux_mod_aux_mod_aux_mod_v_main_~i~0_79_46_33_111_62) (<= 1 .cse5) (< .cse5 4294967297) (not (= aux_mod_aux_mod_aux_mod_aux_mod_v_main_~i~0_79_46_33_111_62 0)) (< aux_mod_v_main_~j~0_65_46 4294967296) (<= 0 aux_mod_v_main_~j~0_65_46) (<= (+ .cse2 1) .cse1)))))) is different from false