/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/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/loop-acceleration/nested_1-2.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-d966a43 [2022-01-31 02:14:55,514 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-01-31 02:14:55,516 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-01-31 02:14:55,568 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-01-31 02:14:55,569 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-01-31 02:14:55,570 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-01-31 02:14:55,572 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-01-31 02:14:55,574 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-01-31 02:14:55,575 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-01-31 02:14:55,575 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-01-31 02:14:55,576 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-01-31 02:14:55,577 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-01-31 02:14:55,577 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-01-31 02:14:55,578 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-01-31 02:14:55,578 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-01-31 02:14:55,579 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-01-31 02:14:55,580 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-01-31 02:14:55,580 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-01-31 02:14:55,581 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-01-31 02:14:55,583 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-01-31 02:14:55,584 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-01-31 02:14:55,586 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-01-31 02:14:55,587 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-01-31 02:14:55,588 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-01-31 02:14:55,590 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-01-31 02:14:55,590 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-01-31 02:14:55,590 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-01-31 02:14:55,591 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-01-31 02:14:55,591 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-01-31 02:14:55,591 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-01-31 02:14:55,592 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-01-31 02:14:55,592 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-01-31 02:14:55,593 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-01-31 02:14:55,593 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-01-31 02:14:55,594 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-01-31 02:14:55,594 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-01-31 02:14:55,595 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-01-31 02:14:55,595 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-01-31 02:14:55,600 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-01-31 02:14:55,601 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-01-31 02:14:55,608 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-01-31 02:14:55,609 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2022-01-31 02:14:55,628 INFO L113 SettingsManager]: Loading preferences was successful [2022-01-31 02:14:55,628 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-01-31 02:14:55,628 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-01-31 02:14:55,628 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-01-31 02:14:55,629 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-01-31 02:14:55,629 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-01-31 02:14:55,629 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-01-31 02:14:55,629 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-01-31 02:14:55,629 INFO L138 SettingsManager]: * Use SBE=true [2022-01-31 02:14:55,629 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-01-31 02:14:55,630 INFO L138 SettingsManager]: * sizeof long=4 [2022-01-31 02:14:55,630 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-01-31 02:14:55,630 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-01-31 02:14:55,630 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-01-31 02:14:55,630 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-01-31 02:14:55,630 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-01-31 02:14:55,630 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-01-31 02:14:55,630 INFO L138 SettingsManager]: * sizeof long double=12 [2022-01-31 02:14:55,630 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-01-31 02:14:55,630 INFO L138 SettingsManager]: * Use constant arrays=true [2022-01-31 02:14:55,630 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-01-31 02:14:55,631 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-01-31 02:14:55,631 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-01-31 02:14:55,631 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-01-31 02:14:55,631 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-31 02:14:55,631 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-01-31 02:14:55,631 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-01-31 02:14:55,631 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-01-31 02:14:55,631 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-01-31 02:14:55,631 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-01-31 02:14:55,631 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-01-31 02:14:55,631 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-01-31 02:14:55,632 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-01-31 02:14:55,632 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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 02:14:55,815 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-01-31 02:14:55,830 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-01-31 02:14:55,831 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-01-31 02:14:55,832 INFO L271 PluginConnector]: Initializing CDTParser... [2022-01-31 02:14:55,832 INFO L275 PluginConnector]: CDTParser initialized [2022-01-31 02:14:55,833 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-acceleration/nested_1-2.c [2022-01-31 02:14:55,880 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cdf1f81d1/9de24aadbfc34c80bf74f27237b4cbe9/FLAGa5a72db24 [2022-01-31 02:14:56,237 INFO L306 CDTParser]: Found 1 translation units. [2022-01-31 02:14:56,238 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-acceleration/nested_1-2.c [2022-01-31 02:14:56,243 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cdf1f81d1/9de24aadbfc34c80bf74f27237b4cbe9/FLAGa5a72db24 [2022-01-31 02:14:56,251 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cdf1f81d1/9de24aadbfc34c80bf74f27237b4cbe9 [2022-01-31 02:14:56,253 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-01-31 02:14:56,255 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-01-31 02:14:56,259 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-01-31 02:14:56,259 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-01-31 02:14:56,261 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-01-31 02:14:56,262 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.01 02:14:56" (1/1) ... [2022-01-31 02:14:56,262 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@284bf98e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 02:14:56, skipping insertion in model container [2022-01-31 02:14:56,263 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.01 02:14:56" (1/1) ... [2022-01-31 02:14:56,267 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-01-31 02:14:56,274 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-01-31 02:14:56,361 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-acceleration/nested_1-2.c[322,335] [2022-01-31 02:14:56,400 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-31 02:14:56,406 INFO L203 MainTranslator]: Completed pre-run [2022-01-31 02:14:56,417 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-acceleration/nested_1-2.c[322,335] [2022-01-31 02:14:56,419 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-31 02:14:56,428 INFO L208 MainTranslator]: Completed translation [2022-01-31 02:14:56,428 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 02:14:56 WrapperNode [2022-01-31 02:14:56,429 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-01-31 02:14:56,429 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-01-31 02:14:56,429 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-01-31 02:14:56,430 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-01-31 02:14:56,438 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 02:14:56" (1/1) ... [2022-01-31 02:14:56,438 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 02:14:56" (1/1) ... [2022-01-31 02:14:56,444 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 02:14:56" (1/1) ... [2022-01-31 02:14:56,445 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 02:14:56" (1/1) ... [2022-01-31 02:14:56,452 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 02:14:56" (1/1) ... [2022-01-31 02:14:56,455 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 02:14:56" (1/1) ... [2022-01-31 02:14:56,455 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 02:14:56" (1/1) ... [2022-01-31 02:14:56,461 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-01-31 02:14:56,462 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-01-31 02:14:56,462 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-01-31 02:14:56,462 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-01-31 02:14:56,463 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 02:14:56" (1/1) ... [2022-01-31 02:14:56,472 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-31 02:14:56,480 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 02:14:56,490 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 02:14:56,507 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 02:14:56,518 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-01-31 02:14:56,519 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-01-31 02:14:56,519 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-01-31 02:14:56,519 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-01-31 02:14:56,520 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-01-31 02:14:56,521 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-01-31 02:14:56,521 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-01-31 02:14:56,522 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-01-31 02:14:56,522 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-01-31 02:14:56,522 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-01-31 02:14:56,522 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-01-31 02:14:56,522 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-01-31 02:14:56,522 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-01-31 02:14:56,522 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-01-31 02:14:56,522 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-01-31 02:14:56,522 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-01-31 02:14:56,522 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-01-31 02:14:56,564 INFO L234 CfgBuilder]: Building ICFG [2022-01-31 02:14:56,566 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-01-31 02:14:56,640 INFO L275 CfgBuilder]: Performing block encoding [2022-01-31 02:14:56,644 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-01-31 02:14:56,644 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-01-31 02:14:56,645 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.01 02:14:56 BoogieIcfgContainer [2022-01-31 02:14:56,645 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-01-31 02:14:56,646 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-01-31 02:14:56,646 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-01-31 02:14:56,658 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-01-31 02:14:56,659 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 31.01 02:14:56" (1/3) ... [2022-01-31 02:14:56,659 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@55fa1dd5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.01 02:14:56, skipping insertion in model container [2022-01-31 02:14:56,659 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 02:14:56" (2/3) ... [2022-01-31 02:14:56,659 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@55fa1dd5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.01 02:14:56, skipping insertion in model container [2022-01-31 02:14:56,660 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.01 02:14:56" (3/3) ... [2022-01-31 02:14:56,663 INFO L111 eAbstractionObserver]: Analyzing ICFG nested_1-2.c [2022-01-31 02:14:56,666 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-01-31 02:14:56,666 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-01-31 02:14:56,699 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-01-31 02:14:56,704 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, 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=FAST_UPR [2022-01-31 02:14:56,705 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-01-31 02:14:56,728 INFO L276 IsEmpty]: Start isEmpty. Operand has 20 states, 12 states have (on average 1.5) internal successors, (18), 13 states have internal predecessors, (18), 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 02:14:56,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-01-31 02:14:56,731 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 02:14:56,732 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 02:14:56,732 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 02:14:56,735 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 02:14:56,736 INFO L85 PathProgramCache]: Analyzing trace with hash 2021311625, now seen corresponding path program 1 times [2022-01-31 02:14:56,741 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 02:14:56,741 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [368342063] [2022-01-31 02:14:56,742 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 02:14:56,742 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 02:14:56,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 02:14:56,906 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 02:14:56,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 02:14:56,914 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 02:14:56,915 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 02:14:56,915 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [368342063] [2022-01-31 02:14:56,916 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [368342063] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 02:14:56,916 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 02:14:56,916 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-31 02:14:56,917 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1228587557] [2022-01-31 02:14:56,917 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 02:14:56,920 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-31 02:14:56,920 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 02:14:56,937 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-31 02:14:56,937 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-31 02:14:56,939 INFO L87 Difference]: Start difference. First operand has 20 states, 12 states have (on average 1.5) internal successors, (18), 13 states have internal predecessors, (18), 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 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 02:14:57,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 02:14:57,003 INFO L93 Difference]: Finished difference Result 37 states and 50 transitions. [2022-01-31 02:14:57,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-01-31 02:14:57,005 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2022-01-31 02:14:57,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 02:14:57,011 INFO L225 Difference]: With dead ends: 37 [2022-01-31 02:14:57,012 INFO L226 Difference]: Without dead ends: 17 [2022-01-31 02:14:57,014 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-01-31 02:14:57,018 INFO L933 BasicCegarLoop]: 18 mSDtfsCounter, 18 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-31 02:14:57,019 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [19 Valid, 27 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-31 02:14:57,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2022-01-31 02:14:57,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 15. [2022-01-31 02:14:57,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 10 states have (on average 1.2) internal successors, (12), 10 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 02:14:57,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 16 transitions. [2022-01-31 02:14:57,052 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 16 transitions. Word has length 11 [2022-01-31 02:14:57,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 02:14:57,052 INFO L470 AbstractCegarLoop]: Abstraction has 15 states and 16 transitions. [2022-01-31 02:14:57,052 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 02:14:57,052 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 16 transitions. [2022-01-31 02:14:57,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-01-31 02:14:57,053 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 02:14:57,053 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 02:14:57,053 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-01-31 02:14:57,053 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 02:14:57,054 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 02:14:57,054 INFO L85 PathProgramCache]: Analyzing trace with hash -2037585725, now seen corresponding path program 1 times [2022-01-31 02:14:57,054 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 02:14:57,054 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1267562935] [2022-01-31 02:14:57,054 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 02:14:57,055 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 02:14:57,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 02:14:57,117 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 02:14:57,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 02:14:57,146 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 02:14:57,147 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 02:14:57,147 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1267562935] [2022-01-31 02:14:57,147 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1267562935] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 02:14:57,147 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 02:14:57,147 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-31 02:14:57,147 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1695199963] [2022-01-31 02:14:57,148 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 02:14:57,148 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-31 02:14:57,149 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 02:14:57,149 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-31 02:14:57,149 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-31 02:14:57,149 INFO L87 Difference]: Start difference. First operand 15 states and 16 transitions. Second operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 3 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 02:14:57,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 02:14:57,182 INFO L93 Difference]: Finished difference Result 24 states and 27 transitions. [2022-01-31 02:14:57,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-01-31 02:14:57,183 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 3 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 02:14:57,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 02:14:57,183 INFO L225 Difference]: With dead ends: 24 [2022-01-31 02:14:57,184 INFO L226 Difference]: Without dead ends: 16 [2022-01-31 02:14:57,184 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-01-31 02:14:57,185 INFO L933 BasicCegarLoop]: 14 mSDtfsCounter, 10 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 21 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-31 02:14:57,185 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [10 Valid, 21 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-31 02:14:57,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2022-01-31 02:14:57,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2022-01-31 02:14:57,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 11 states have internal predecessors, (13), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 02:14:57,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 17 transitions. [2022-01-31 02:14:57,188 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 17 transitions. Word has length 14 [2022-01-31 02:14:57,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 02:14:57,189 INFO L470 AbstractCegarLoop]: Abstraction has 16 states and 17 transitions. [2022-01-31 02:14:57,189 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 3 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 02:14:57,189 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 17 transitions. [2022-01-31 02:14:57,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-01-31 02:14:57,189 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 02:14:57,189 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 02:14:57,189 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-01-31 02:14:57,189 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 02:14:57,190 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 02:14:57,190 INFO L85 PathProgramCache]: Analyzing trace with hash -183414982, now seen corresponding path program 1 times [2022-01-31 02:14:57,190 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 02:14:57,190 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [790964798] [2022-01-31 02:14:57,190 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 02:14:57,191 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 02:14:57,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 02:14:57,251 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 02:14:57,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 02:14:57,257 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 02:14:57,257 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 02:14:57,257 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [790964798] [2022-01-31 02:14:57,257 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [790964798] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-31 02:14:57,258 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [647581066] [2022-01-31 02:14:57,258 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 02:14:57,258 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 02:14:57,258 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 02:14:57,260 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-31 02:14:57,260 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-01-31 02:14:57,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 02:14:57,307 INFO L263 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 5 conjunts are in the unsatisfiable core [2022-01-31 02:14:57,310 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 02:14:57,369 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 02:14:57,369 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 02:14:57,442 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 02:14:57,442 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [647581066] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 02:14:57,442 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-31 02:14:57,442 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 8 [2022-01-31 02:14:57,442 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [909022152] [2022-01-31 02:14:57,443 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-31 02:14:57,443 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-01-31 02:14:57,443 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 02:14:57,444 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-01-31 02:14:57,444 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2022-01-31 02:14:57,444 INFO L87 Difference]: Start difference. First operand 16 states and 17 transitions. Second operand has 8 states, 8 states have (on average 2.125) internal successors, (17), 7 states have internal predecessors, (17), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 02:14:57,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 02:14:57,515 INFO L93 Difference]: Finished difference Result 28 states and 33 transitions. [2022-01-31 02:14:57,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-01-31 02:14:57,516 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.125) internal successors, (17), 7 states have internal predecessors, (17), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2022-01-31 02:14:57,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 02:14:57,517 INFO L225 Difference]: With dead ends: 28 [2022-01-31 02:14:57,517 INFO L226 Difference]: Without dead ends: 19 [2022-01-31 02:14:57,519 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=83, Unknown=0, NotChecked=0, Total=132 [2022-01-31 02:14:57,521 INFO L933 BasicCegarLoop]: 14 mSDtfsCounter, 10 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-31 02:14:57,523 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [10 Valid, 26 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-31 02:14:57,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2022-01-31 02:14:57,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2022-01-31 02:14:57,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 14 states have (on average 1.1428571428571428) internal successors, (16), 14 states have internal predecessors, (16), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 02:14:57,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 20 transitions. [2022-01-31 02:14:57,531 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 20 transitions. Word has length 15 [2022-01-31 02:14:57,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 02:14:57,531 INFO L470 AbstractCegarLoop]: Abstraction has 19 states and 20 transitions. [2022-01-31 02:14:57,531 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.125) internal successors, (17), 7 states have internal predecessors, (17), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 02:14:57,532 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 20 transitions. [2022-01-31 02:14:57,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-01-31 02:14:57,532 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 02:14:57,532 INFO L514 BasicCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 02:14:57,551 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-01-31 02:14:57,753 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 02:14:57,754 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 02:14:57,754 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 02:14:57,754 INFO L85 PathProgramCache]: Analyzing trace with hash 934170243, now seen corresponding path program 2 times [2022-01-31 02:14:57,754 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 02:14:57,755 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [102751562] [2022-01-31 02:14:57,755 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 02:14:57,755 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 02:14:57,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 02:14:57,824 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 02:14:57,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 02:14:57,830 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 1 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 02:14:57,830 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 02:14:57,830 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [102751562] [2022-01-31 02:14:57,830 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [102751562] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-31 02:14:57,830 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [984392199] [2022-01-31 02:14:57,830 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-01-31 02:14:57,830 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 02:14:57,831 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 02:14:57,832 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-31 02:14:57,833 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-01-31 02:14:57,858 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-01-31 02:14:57,859 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-31 02:14:57,859 INFO L263 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 10 conjunts are in the unsatisfiable core [2022-01-31 02:14:57,860 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 02:14:57,942 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-01-31 02:14:57,942 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 02:14:58,028 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-01-31 02:14:58,029 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [984392199] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 02:14:58,029 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-31 02:14:58,029 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6, 6] total 16 [2022-01-31 02:14:58,029 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1940051962] [2022-01-31 02:14:58,029 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-31 02:14:58,032 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-01-31 02:14:58,033 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 02:14:58,033 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-01-31 02:14:58,036 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=183, Unknown=0, NotChecked=0, Total=240 [2022-01-31 02:14:58,036 INFO L87 Difference]: Start difference. First operand 19 states and 20 transitions. Second operand has 16 states, 16 states have (on average 1.9375) internal successors, (31), 15 states have internal predecessors, (31), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 02:14:58,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 02:14:58,543 INFO L93 Difference]: Finished difference Result 56 states and 68 transitions. [2022-01-31 02:14:58,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-01-31 02:14:58,543 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.9375) internal successors, (31), 15 states have internal predecessors, (31), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2022-01-31 02:14:58,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 02:14:58,544 INFO L225 Difference]: With dead ends: 56 [2022-01-31 02:14:58,544 INFO L226 Difference]: Without dead ends: 44 [2022-01-31 02:14:58,545 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 387 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=392, Invalid=1248, Unknown=0, NotChecked=0, Total=1640 [2022-01-31 02:14:58,545 INFO L933 BasicCegarLoop]: 13 mSDtfsCounter, 39 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 168 mSolverCounterSat, 85 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 253 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 85 IncrementalHoareTripleChecker+Valid, 168 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-31 02:14:58,546 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [39 Valid, 65 Invalid, 253 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [85 Valid, 168 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-31 02:14:58,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2022-01-31 02:14:58,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2022-01-31 02:14:58,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 39 states have (on average 1.1282051282051282) internal successors, (44), 39 states have internal predecessors, (44), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 02:14:58,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 48 transitions. [2022-01-31 02:14:58,553 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 48 transitions. Word has length 18 [2022-01-31 02:14:58,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 02:14:58,553 INFO L470 AbstractCegarLoop]: Abstraction has 44 states and 48 transitions. [2022-01-31 02:14:58,553 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 1.9375) internal successors, (31), 15 states have internal predecessors, (31), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 02:14:58,554 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 48 transitions. [2022-01-31 02:14:58,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-01-31 02:14:58,554 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 02:14:58,554 INFO L514 BasicCegarLoop]: trace histogram [20, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 02:14:58,570 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-01-31 02:14:58,756 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2022-01-31 02:14:58,756 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 02:14:58,757 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 02:14:58,757 INFO L85 PathProgramCache]: Analyzing trace with hash 1395208781, now seen corresponding path program 3 times [2022-01-31 02:14:58,757 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 02:14:58,757 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [914572365] [2022-01-31 02:14:58,757 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 02:14:58,757 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 02:14:58,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 02:14:58,863 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 02:14:58,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 02:14:58,877 INFO L134 CoverageAnalysis]: Checked inductivity of 292 backedges. 112 proven. 15 refuted. 0 times theorem prover too weak. 165 trivial. 0 not checked. [2022-01-31 02:14:58,877 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 02:14:58,880 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [914572365] [2022-01-31 02:14:58,881 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [914572365] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-31 02:14:58,881 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1929927993] [2022-01-31 02:14:58,881 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-01-31 02:14:58,881 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 02:14:58,881 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 02:14:58,882 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-31 02:14:58,883 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-01-31 02:14:58,957 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2022-01-31 02:14:58,957 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-31 02:14:58,958 INFO L263 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 13 conjunts are in the unsatisfiable core [2022-01-31 02:14:58,959 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 02:14:59,043 INFO L134 CoverageAnalysis]: Checked inductivity of 292 backedges. 115 proven. 15 refuted. 0 times theorem prover too weak. 162 trivial. 0 not checked. [2022-01-31 02:14:59,043 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 02:14:59,172 INFO L134 CoverageAnalysis]: Checked inductivity of 292 backedges. 115 proven. 15 refuted. 0 times theorem prover too weak. 162 trivial. 0 not checked. [2022-01-31 02:14:59,173 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1929927993] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 02:14:59,173 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-31 02:14:59,173 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 16 [2022-01-31 02:14:59,173 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [229885359] [2022-01-31 02:14:59,173 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-31 02:14:59,173 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-01-31 02:14:59,173 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 02:14:59,174 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-01-31 02:14:59,174 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=165, Unknown=0, NotChecked=0, Total=240 [2022-01-31 02:14:59,174 INFO L87 Difference]: Start difference. First operand 44 states and 48 transitions. Second operand has 16 states, 16 states have (on average 2.0) internal successors, (32), 15 states have internal predecessors, (32), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 02:14:59,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 02:14:59,408 INFO L93 Difference]: Finished difference Result 95 states and 122 transitions. [2022-01-31 02:14:59,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-01-31 02:14:59,408 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.0) internal successors, (32), 15 states have internal predecessors, (32), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 43 [2022-01-31 02:14:59,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 02:14:59,409 INFO L225 Difference]: With dead ends: 95 [2022-01-31 02:14:59,409 INFO L226 Difference]: Without dead ends: 64 [2022-01-31 02:14:59,410 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 80 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=192, Invalid=458, Unknown=0, NotChecked=0, Total=650 [2022-01-31 02:14:59,410 INFO L933 BasicCegarLoop]: 14 mSDtfsCounter, 10 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 46 SdHoareTripleChecker+Invalid, 117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-31 02:14:59,410 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [10 Valid, 46 Invalid, 117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-31 02:14:59,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2022-01-31 02:14:59,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2022-01-31 02:14:59,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 59 states have (on average 1.0847457627118644) internal successors, (64), 59 states have internal predecessors, (64), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 02:14:59,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 68 transitions. [2022-01-31 02:14:59,420 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 68 transitions. Word has length 43 [2022-01-31 02:14:59,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 02:14:59,420 INFO L470 AbstractCegarLoop]: Abstraction has 64 states and 68 transitions. [2022-01-31 02:14:59,420 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.0) internal successors, (32), 15 states have internal predecessors, (32), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 02:14:59,421 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 68 transitions. [2022-01-31 02:14:59,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2022-01-31 02:14:59,421 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 02:14:59,422 INFO L514 BasicCegarLoop]: trace histogram [40, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 02:14:59,429 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-01-31 02:14:59,625 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 02:14:59,626 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 02:14:59,626 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 02:14:59,626 INFO L85 PathProgramCache]: Analyzing trace with hash 538347785, now seen corresponding path program 4 times [2022-01-31 02:14:59,626 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 02:14:59,627 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1069470419] [2022-01-31 02:14:59,627 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 02:14:59,627 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 02:14:59,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 02:14:59,779 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 02:14:59,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 02:14:59,806 INFO L134 CoverageAnalysis]: Checked inductivity of 962 backedges. 0 proven. 742 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2022-01-31 02:14:59,806 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 02:14:59,806 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1069470419] [2022-01-31 02:14:59,807 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1069470419] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-31 02:14:59,807 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2110724566] [2022-01-31 02:14:59,807 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-01-31 02:14:59,807 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 02:14:59,807 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 02:14:59,809 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-31 02:14:59,810 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-01-31 02:14:59,844 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-01-31 02:14:59,845 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-31 02:14:59,845 INFO L263 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 13 conjunts are in the unsatisfiable core [2022-01-31 02:14:59,848 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 02:15:00,057 INFO L134 CoverageAnalysis]: Checked inductivity of 962 backedges. 0 proven. 742 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2022-01-31 02:15:00,058 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 02:15:00,182 INFO L134 CoverageAnalysis]: Checked inductivity of 962 backedges. 0 proven. 494 refuted. 0 times theorem prover too weak. 468 trivial. 0 not checked. [2022-01-31 02:15:00,182 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2110724566] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 02:15:00,182 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-31 02:15:00,183 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 6] total 13 [2022-01-31 02:15:00,183 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [914752061] [2022-01-31 02:15:00,183 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-31 02:15:00,184 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-01-31 02:15:00,184 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 02:15:00,184 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-01-31 02:15:00,185 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2022-01-31 02:15:00,185 INFO L87 Difference]: Start difference. First operand 64 states and 68 transitions. Second operand has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 11 states have internal predecessors, (38), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 02:15:00,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 02:15:00,369 INFO L93 Difference]: Finished difference Result 110 states and 118 transitions. [2022-01-31 02:15:00,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-01-31 02:15:00,370 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 11 states have internal predecessors, (38), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 63 [2022-01-31 02:15:00,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 02:15:00,372 INFO L225 Difference]: With dead ends: 110 [2022-01-31 02:15:00,373 INFO L226 Difference]: Without dead ends: 102 [2022-01-31 02:15:00,373 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 122 SyntacticMatches, 2 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=86, Invalid=376, Unknown=0, NotChecked=0, Total=462 [2022-01-31 02:15:00,374 INFO L933 BasicCegarLoop]: 21 mSDtfsCounter, 44 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 219 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 63 SdHoareTripleChecker+Invalid, 233 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 219 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-31 02:15:00,375 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [44 Valid, 63 Invalid, 233 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 219 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-31 02:15:00,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2022-01-31 02:15:00,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 77. [2022-01-31 02:15:00,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 72 states have (on average 1.0833333333333333) internal successors, (78), 72 states have internal predecessors, (78), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 02:15:00,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 82 transitions. [2022-01-31 02:15:00,398 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 82 transitions. Word has length 63 [2022-01-31 02:15:00,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 02:15:00,399 INFO L470 AbstractCegarLoop]: Abstraction has 77 states and 82 transitions. [2022-01-31 02:15:00,399 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 11 states have internal predecessors, (38), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 02:15:00,399 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 82 transitions. [2022-01-31 02:15:00,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2022-01-31 02:15:00,399 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 02:15:00,400 INFO L514 BasicCegarLoop]: trace histogram [50, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 02:15:00,415 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-01-31 02:15:00,606 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 02:15:00,606 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 02:15:00,607 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 02:15:00,607 INFO L85 PathProgramCache]: Analyzing trace with hash -445755741, now seen corresponding path program 5 times [2022-01-31 02:15:00,607 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 02:15:00,607 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [173260974] [2022-01-31 02:15:00,607 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 02:15:00,607 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 02:15:00,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 02:15:00,730 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 02:15:00,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 02:15:00,734 INFO L134 CoverageAnalysis]: Checked inductivity of 1510 backedges. 0 proven. 1235 refuted. 0 times theorem prover too weak. 275 trivial. 0 not checked. [2022-01-31 02:15:00,735 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 02:15:00,735 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [173260974] [2022-01-31 02:15:00,735 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [173260974] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-31 02:15:00,735 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [233328446] [2022-01-31 02:15:00,735 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-01-31 02:15:00,735 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 02:15:00,735 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 02:15:00,736 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-31 02:15:00,755 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-01-31 02:15:01,484 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 26 check-sat command(s) [2022-01-31 02:15:01,484 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-31 02:15:01,488 INFO L263 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 13 conjunts are in the unsatisfiable core [2022-01-31 02:15:01,490 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 02:15:01,687 INFO L134 CoverageAnalysis]: Checked inductivity of 1510 backedges. 0 proven. 1235 refuted. 0 times theorem prover too weak. 275 trivial. 0 not checked. [2022-01-31 02:15:01,688 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 02:15:01,870 INFO L134 CoverageAnalysis]: Checked inductivity of 1510 backedges. 0 proven. 1235 refuted. 0 times theorem prover too weak. 275 trivial. 0 not checked. [2022-01-31 02:15:01,870 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [233328446] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 02:15:01,871 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-31 02:15:01,871 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 16 [2022-01-31 02:15:01,871 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1368352112] [2022-01-31 02:15:01,871 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-31 02:15:01,871 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-01-31 02:15:01,871 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 02:15:01,871 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-01-31 02:15:01,872 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=163, Unknown=0, NotChecked=0, Total=240 [2022-01-31 02:15:01,872 INFO L87 Difference]: Start difference. First operand 77 states and 82 transitions. Second operand has 16 states, 16 states have (on average 3.25) internal successors, (52), 15 states have internal predecessors, (52), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 02:15:02,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 02:15:02,506 INFO L93 Difference]: Finished difference Result 186 states and 202 transitions. [2022-01-31 02:15:02,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-01-31 02:15:02,507 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 3.25) internal successors, (52), 15 states have internal predecessors, (52), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 76 [2022-01-31 02:15:02,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 02:15:02,508 INFO L225 Difference]: With dead ends: 186 [2022-01-31 02:15:02,508 INFO L226 Difference]: Without dead ends: 181 [2022-01-31 02:15:02,508 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 174 GetRequests, 147 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=233, Invalid=523, Unknown=0, NotChecked=0, Total=756 [2022-01-31 02:15:02,509 INFO L933 BasicCegarLoop]: 23 mSDtfsCounter, 81 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 197 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 60 SdHoareTripleChecker+Invalid, 227 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 197 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-31 02:15:02,509 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [81 Valid, 60 Invalid, 227 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 197 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-31 02:15:02,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2022-01-31 02:15:02,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 181. [2022-01-31 02:15:02,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 181 states, 176 states have (on average 1.0795454545454546) internal successors, (190), 176 states have internal predecessors, (190), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 02:15:02,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 194 transitions. [2022-01-31 02:15:02,554 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 194 transitions. Word has length 76 [2022-01-31 02:15:02,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 02:15:02,554 INFO L470 AbstractCegarLoop]: Abstraction has 181 states and 194 transitions. [2022-01-31 02:15:02,555 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 3.25) internal successors, (52), 15 states have internal predecessors, (52), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 02:15:02,555 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 194 transitions. [2022-01-31 02:15:02,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2022-01-31 02:15:02,556 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 02:15:02,556 INFO L514 BasicCegarLoop]: trace histogram [130, 13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 02:15:02,567 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-01-31 02:15:02,765 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 02:15:02,766 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 02:15:02,766 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 02:15:02,766 INFO L85 PathProgramCache]: Analyzing trace with hash -318167645, now seen corresponding path program 6 times [2022-01-31 02:15:02,766 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 02:15:02,767 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1637280842] [2022-01-31 02:15:02,767 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 02:15:02,767 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 02:15:02,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 02:15:03,021 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 02:15:03,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 02:15:03,029 INFO L134 CoverageAnalysis]: Checked inductivity of 10322 backedges. 0 proven. 9607 refuted. 0 times theorem prover too weak. 715 trivial. 0 not checked. [2022-01-31 02:15:03,029 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 02:15:03,029 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1637280842] [2022-01-31 02:15:03,029 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1637280842] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-31 02:15:03,029 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [829714798] [2022-01-31 02:15:03,029 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-01-31 02:15:03,030 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 02:15:03,030 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 02:15:03,031 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-31 02:15:03,047 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-01-31 02:15:08,664 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 55 check-sat command(s) [2022-01-31 02:15:08,664 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-31 02:15:08,677 INFO L263 TraceCheckSpWp]: Trace formula consists of 473 conjuncts, 29 conjunts are in the unsatisfiable core [2022-01-31 02:15:08,681 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 02:15:09,210 INFO L134 CoverageAnalysis]: Checked inductivity of 10322 backedges. 0 proven. 9607 refuted. 0 times theorem prover too weak. 715 trivial. 0 not checked. [2022-01-31 02:15:09,210 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 02:15:09,775 INFO L134 CoverageAnalysis]: Checked inductivity of 10322 backedges. 0 proven. 9607 refuted. 0 times theorem prover too weak. 715 trivial. 0 not checked. [2022-01-31 02:15:09,775 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [829714798] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 02:15:09,775 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-31 02:15:09,775 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 16, 16] total 32 [2022-01-31 02:15:09,775 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1472462643] [2022-01-31 02:15:09,775 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-31 02:15:09,776 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-01-31 02:15:09,776 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 02:15:09,776 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-01-31 02:15:09,777 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=285, Invalid=707, Unknown=0, NotChecked=0, Total=992 [2022-01-31 02:15:09,777 INFO L87 Difference]: Start difference. First operand 181 states and 194 transitions. Second operand has 32 states, 32 states have (on average 3.625) internal successors, (116), 31 states have internal predecessors, (116), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 02:15:20,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 02:15:20,744 INFO L93 Difference]: Finished difference Result 394 states and 430 transitions. [2022-01-31 02:15:20,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-01-31 02:15:20,745 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 3.625) internal successors, (116), 31 states have internal predecessors, (116), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 180 [2022-01-31 02:15:20,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 02:15:20,746 INFO L225 Difference]: With dead ends: 394 [2022-01-31 02:15:20,746 INFO L226 Difference]: Without dead ends: 389 [2022-01-31 02:15:20,748 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 406 GetRequests, 347 SyntacticMatches, 1 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 424 ImplicationChecksByTransitivity, 10.9s TimeCoverageRelationStatistics Valid=985, Invalid=2555, Unknown=0, NotChecked=0, Total=3540 [2022-01-31 02:15:20,748 INFO L933 BasicCegarLoop]: 39 mSDtfsCounter, 219 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 892 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 219 SdHoareTripleChecker+Valid, 116 SdHoareTripleChecker+Invalid, 941 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 892 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-01-31 02:15:20,748 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [219 Valid, 116 Invalid, 941 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 892 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-01-31 02:15:20,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 389 states. [2022-01-31 02:15:20,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 389 to 389. [2022-01-31 02:15:20,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 389 states, 384 states have (on average 1.078125) internal successors, (414), 384 states have internal predecessors, (414), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 02:15:20,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 389 states and 418 transitions. [2022-01-31 02:15:20,792 INFO L78 Accepts]: Start accepts. Automaton has 389 states and 418 transitions. Word has length 180 [2022-01-31 02:15:20,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 02:15:20,793 INFO L470 AbstractCegarLoop]: Abstraction has 389 states and 418 transitions. [2022-01-31 02:15:20,793 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 3.625) internal successors, (116), 31 states have internal predecessors, (116), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 02:15:20,793 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 418 transitions. [2022-01-31 02:15:20,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 389 [2022-01-31 02:15:20,796 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 02:15:20,796 INFO L514 BasicCegarLoop]: trace histogram [290, 29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 02:15:20,804 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-01-31 02:15:21,003 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 02:15:21,004 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 02:15:21,004 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 02:15:21,004 INFO L85 PathProgramCache]: Analyzing trace with hash -1293036637, now seen corresponding path program 7 times [2022-01-31 02:15:21,004 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 02:15:21,005 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [609929850] [2022-01-31 02:15:21,005 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 02:15:21,005 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 02:15:21,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 02:15:21,822 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 02:15:21,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 02:15:21,848 INFO L134 CoverageAnalysis]: Checked inductivity of 51562 backedges. 0 proven. 49967 refuted. 0 times theorem prover too weak. 1595 trivial. 0 not checked. [2022-01-31 02:15:21,848 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 02:15:21,848 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [609929850] [2022-01-31 02:15:21,848 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [609929850] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-31 02:15:21,848 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [943589474] [2022-01-31 02:15:21,848 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-01-31 02:15:21,849 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 02:15:21,849 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 02:15:21,852 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-31 02:15:21,854 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-01-31 02:15:22,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 02:15:22,312 INFO L263 TraceCheckSpWp]: Trace formula consists of 1097 conjuncts, 61 conjunts are in the unsatisfiable core [2022-01-31 02:15:22,321 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 02:15:23,466 INFO L134 CoverageAnalysis]: Checked inductivity of 51562 backedges. 0 proven. 49967 refuted. 0 times theorem prover too weak. 1595 trivial. 0 not checked. [2022-01-31 02:15:23,467 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 02:15:25,318 INFO L134 CoverageAnalysis]: Checked inductivity of 51562 backedges. 0 proven. 49967 refuted. 0 times theorem prover too weak. 1595 trivial. 0 not checked. [2022-01-31 02:15:25,319 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [943589474] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 02:15:25,319 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-31 02:15:25,319 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 32, 32] total 64 [2022-01-31 02:15:25,319 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1344585429] [2022-01-31 02:15:25,319 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-31 02:15:25,320 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 64 states [2022-01-31 02:15:25,320 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 02:15:25,321 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2022-01-31 02:15:25,321 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1085, Invalid=2947, Unknown=0, NotChecked=0, Total=4032 [2022-01-31 02:15:25,322 INFO L87 Difference]: Start difference. First operand 389 states and 418 transitions. Second operand has 64 states, 64 states have (on average 3.8125) internal successors, (244), 63 states have internal predecessors, (244), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 02:15:41,845 WARN L228 SmtUtils]: Spent 6.06s on a formula simplification. DAG size of input: 128 DAG size of output: 16 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-01-31 02:16:39,171 WARN L228 SmtUtils]: Spent 5.05s on a formula simplification. DAG size of input: 116 DAG size of output: 16 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-01-31 02:17:04,227 WARN L228 SmtUtils]: Spent 5.11s on a formula simplification. DAG size of input: 112 DAG size of output: 16 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-01-31 02:21:03,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 02:21:03,530 INFO L93 Difference]: Finished difference Result 810 states and 886 transitions. [2022-01-31 02:21:03,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2022-01-31 02:21:03,530 INFO L78 Accepts]: Start accepts. Automaton has has 64 states, 64 states have (on average 3.8125) internal successors, (244), 63 states have internal predecessors, (244), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 388 [2022-01-31 02:21:03,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 02:21:03,533 INFO L225 Difference]: With dead ends: 810 [2022-01-31 02:21:03,533 INFO L226 Difference]: Without dead ends: 805 [2022-01-31 02:21:03,537 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 870 GetRequests, 747 SyntacticMatches, 1 SemanticMatches, 122 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1878 ImplicationChecksByTransitivity, 338.2s TimeCoverageRelationStatistics Valid=4012, Invalid=11227, Unknown=13, NotChecked=0, Total=15252 [2022-01-31 02:21:03,538 INFO L933 BasicCegarLoop]: 71 mSDtfsCounter, 453 mSDsluCounter, 152 mSDsCounter, 0 mSdLazyCounter, 3874 mSolverCounterSat, 148 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 453 SdHoareTripleChecker+Valid, 223 SdHoareTripleChecker+Invalid, 4022 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 148 IncrementalHoareTripleChecker+Valid, 3874 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-01-31 02:21:03,538 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [453 Valid, 223 Invalid, 4022 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [148 Valid, 3874 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2022-01-31 02:21:03,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 805 states. [2022-01-31 02:21:03,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 805 to 805. [2022-01-31 02:21:03,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 805 states, 800 states have (on average 1.0775) internal successors, (862), 800 states have internal predecessors, (862), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 02:21:03,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 805 states to 805 states and 866 transitions. [2022-01-31 02:21:03,624 INFO L78 Accepts]: Start accepts. Automaton has 805 states and 866 transitions. Word has length 388 [2022-01-31 02:21:03,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 02:21:03,625 INFO L470 AbstractCegarLoop]: Abstraction has 805 states and 866 transitions. [2022-01-31 02:21:03,625 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 64 states, 64 states have (on average 3.8125) internal successors, (244), 63 states have internal predecessors, (244), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 02:21:03,625 INFO L276 IsEmpty]: Start isEmpty. Operand 805 states and 866 transitions. [2022-01-31 02:21:03,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 805 [2022-01-31 02:21:03,637 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 02:21:03,637 INFO L514 BasicCegarLoop]: trace histogram [610, 61, 61, 61, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 02:21:03,661 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-01-31 02:21:03,847 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 02:21:03,848 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 02:21:03,848 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 02:21:03,848 INFO L85 PathProgramCache]: Analyzing trace with hash -1116524637, now seen corresponding path program 8 times [2022-01-31 02:21:03,848 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 02:21:03,848 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2110347498] [2022-01-31 02:21:03,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 02:21:03,849 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 02:21:04,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 02:21:06,381 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 02:21:06,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 02:21:06,425 INFO L134 CoverageAnalysis]: Checked inductivity of 228506 backedges. 0 proven. 225151 refuted. 0 times theorem prover too weak. 3355 trivial. 0 not checked. [2022-01-31 02:21:06,426 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 02:21:06,426 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2110347498] [2022-01-31 02:21:06,426 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2110347498] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-31 02:21:06,426 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1816893518] [2022-01-31 02:21:06,426 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-01-31 02:21:06,426 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 02:21:06,426 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 02:21:06,427 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-31 02:21:06,428 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-01-31 02:21:07,705 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-01-31 02:21:07,706 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-31 02:21:07,718 INFO L263 TraceCheckSpWp]: Trace formula consists of 2249 conjuncts, 125 conjunts are in the unsatisfiable core [2022-01-31 02:21:07,728 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 02:21:10,141 INFO L134 CoverageAnalysis]: Checked inductivity of 228506 backedges. 0 proven. 225151 refuted. 0 times theorem prover too weak. 3355 trivial. 0 not checked. [2022-01-31 02:21:10,141 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 02:21:16,630 INFO L134 CoverageAnalysis]: Checked inductivity of 228506 backedges. 0 proven. 225151 refuted. 0 times theorem prover too weak. 3355 trivial. 0 not checked. [2022-01-31 02:21:16,630 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1816893518] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 02:21:16,630 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-31 02:21:16,630 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [65, 64, 64] total 128 [2022-01-31 02:21:16,631 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1602948117] [2022-01-31 02:21:16,631 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-31 02:21:16,632 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 128 states [2022-01-31 02:21:16,632 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 02:21:16,633 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 128 interpolants. [2022-01-31 02:21:16,636 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=4221, Invalid=12035, Unknown=0, NotChecked=0, Total=16256 [2022-01-31 02:21:16,636 INFO L87 Difference]: Start difference. First operand 805 states and 866 transitions. Second operand has 128 states, 128 states have (on average 3.90625) internal successors, (500), 127 states have internal predecessors, (500), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 02:23:08,069 WARN L228 SmtUtils]: Spent 37.18s on a formula simplification. DAG size of input: 256 DAG size of output: 16 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-01-31 02:23:10,085 WARN L838 $PredicateComparison]: unable to prove that (and (< (mod (+ c_main_~x~0 24) 4294967296) 268435455) (< (mod (+ 20 c_main_~x~0) 4294967296) 268435455) (= |c_#NULL.base| |c_old(#NULL.base)|) (< (mod (+ 6 c_main_~x~0) 4294967296) 268435455) (< (mod (+ c_main_~x~0 54) 4294967296) 268435455) (< (mod (+ 25 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 43 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 14 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 29 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 52 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 48 c_main_~x~0) 4294967296) 268435455) (< (mod (+ c_main_~x~0 27) 4294967296) 268435455) (< (mod (+ 47 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 38 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 56 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 13 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 4 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 34 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 41 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 3 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 53 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 15 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 49 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 58 c_main_~x~0) 4294967296) 268435455) (< (mod c_main_~x~0 4294967296) 268435455) (< (mod (+ 30 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 18 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 40 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 28 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 32 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 35 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 55 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 9 c_main_~x~0) 4294967296) 268435455) (< (mod (+ c_main_~x~0 37) 4294967296) 268435455) (< (mod (+ 42 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 2 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 59 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 5 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 44 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 33 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 16 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 60 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 39 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 7 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 19 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 8 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 26 c_main_~x~0) 4294967296) 268435455) (< (mod (+ c_main_~x~0 50) 4294967296) 268435455) (< (mod (+ 17 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 23 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 46 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 10 c_main_~x~0) 4294967296) 268435455) (< (mod (+ c_main_~x~0 11) 4294967296) 268435455) (< (mod (+ 31 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 12 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 21 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 57 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 36 c_main_~x~0) 4294967296) 268435455) (= |c_#NULL.offset| |c_old(#NULL.offset)|) (< (mod (+ c_main_~x~0 1) 4294967296) 268435455) (< (mod (+ 45 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 51 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 22 c_main_~x~0) 4294967296) 268435455)) is different from false [2022-01-31 02:23:12,103 WARN L838 $PredicateComparison]: unable to prove that (and (< (mod (+ c_main_~x~0 24) 4294967296) 268435455) (< (mod (+ 20 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 6 c_main_~x~0) 4294967296) 268435455) (< (mod (+ c_main_~x~0 54) 4294967296) 268435455) (< (mod (+ 25 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 43 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 14 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 29 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 52 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 48 c_main_~x~0) 4294967296) 268435455) (< (mod (+ c_main_~x~0 27) 4294967296) 268435455) (< (mod (+ 47 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 38 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 56 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 13 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 4 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 34 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 41 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 3 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 53 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 15 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 49 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 58 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 30 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 18 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 40 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 28 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 32 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 35 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 55 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 9 c_main_~x~0) 4294967296) 268435455) (< (mod (+ c_main_~x~0 37) 4294967296) 268435455) (< (mod (+ 42 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 2 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 59 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 5 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 44 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 33 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 16 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 60 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 39 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 7 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 19 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 8 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 26 c_main_~x~0) 4294967296) 268435455) (< (mod (+ c_main_~x~0 50) 4294967296) 268435455) (< (mod (+ 17 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 23 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 46 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 10 c_main_~x~0) 4294967296) 268435455) (< (mod (+ c_main_~x~0 11) 4294967296) 268435455) (< (mod (+ 31 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 12 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 21 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 57 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 36 c_main_~x~0) 4294967296) 268435455) (< (mod (+ c_main_~x~0 1) 4294967296) 268435455) (< (mod (+ 45 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 51 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 22 c_main_~x~0) 4294967296) 268435455)) is different from false [2022-01-31 02:23:14,129 WARN L838 $PredicateComparison]: unable to prove that (and (< (mod (+ c_main_~x~0 24) 4294967296) 268435455) (< (mod (+ 20 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 6 c_main_~x~0) 4294967296) 268435455) (< (mod (+ c_main_~x~0 54) 4294967296) 268435455) (< (mod (+ 25 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 43 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 14 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 29 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 52 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 48 c_main_~x~0) 4294967296) 268435455) (< (mod (+ c_main_~x~0 27) 4294967296) 268435455) (< (mod (+ 47 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 38 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 56 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 13 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 4 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 34 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 41 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 3 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 53 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 15 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 49 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 58 c_main_~x~0) 4294967296) 268435455) (< (mod c_main_~x~0 4294967296) 268435455) (< (mod (+ 30 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 18 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 40 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 28 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 32 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 35 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 55 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 9 c_main_~x~0) 4294967296) 268435455) (< (mod (+ c_main_~x~0 37) 4294967296) 268435455) (< (mod (+ 42 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 2 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 59 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 5 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 44 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 33 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 16 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 39 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 7 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 19 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 8 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 26 c_main_~x~0) 4294967296) 268435455) (< (mod (+ c_main_~x~0 50) 4294967296) 268435455) (< (mod (+ 17 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 23 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 46 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 10 c_main_~x~0) 4294967296) 268435455) (< (mod (+ c_main_~x~0 11) 4294967296) 268435455) (< (mod (+ 31 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 12 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 21 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 57 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 36 c_main_~x~0) 4294967296) 268435455) (< (mod (+ c_main_~x~0 1) 4294967296) 268435455) (< (mod (+ 45 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 51 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 22 c_main_~x~0) 4294967296) 268435455)) is different from false [2022-01-31 02:25:03,070 WARN L228 SmtUtils]: Spent 32.44s on a formula simplification. DAG size of input: 240 DAG size of output: 12 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-01-31 02:25:05,085 WARN L838 $PredicateComparison]: unable to prove that (and (< (mod (+ c_main_~x~0 24) 4294967296) 268435455) (< (mod (+ 20 c_main_~x~0) 4294967296) 268435455) (= |c_#NULL.base| |c_old(#NULL.base)|) (< (mod (+ 6 c_main_~x~0) 4294967296) 268435455) (< (mod (+ c_main_~x~0 54) 4294967296) 268435455) (< (mod (+ 25 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 43 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 14 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 29 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 52 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 48 c_main_~x~0) 4294967296) 268435455) (< (mod (+ c_main_~x~0 27) 4294967296) 268435455) (< (mod (+ 47 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 38 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 56 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 13 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 4 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 34 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 41 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 3 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 53 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 15 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 49 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 58 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 30 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 18 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 40 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 28 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 32 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 35 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 55 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 9 c_main_~x~0) 4294967296) 268435455) (< (mod (+ c_main_~x~0 37) 4294967296) 268435455) (< (mod (+ 42 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 2 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 59 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 5 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 44 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 33 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 16 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 39 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 7 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 19 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 8 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 26 c_main_~x~0) 4294967296) 268435455) (< (mod (+ c_main_~x~0 50) 4294967296) 268435455) (< (mod (+ 17 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 23 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 46 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 10 c_main_~x~0) 4294967296) 268435455) (< (mod (+ c_main_~x~0 11) 4294967296) 268435455) (< (mod (+ 31 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 12 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 21 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 57 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 36 c_main_~x~0) 4294967296) 268435455) (= |c_#NULL.offset| |c_old(#NULL.offset)|) (< (mod (+ c_main_~x~0 1) 4294967296) 268435455) (< (mod (+ 45 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 51 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 22 c_main_~x~0) 4294967296) 268435455)) is different from false [2022-01-31 02:26:51,774 WARN L228 SmtUtils]: Spent 26.95s on a formula simplification. DAG size of input: 238 DAG size of output: 10 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-01-31 02:26:53,787 WARN L838 $PredicateComparison]: unable to prove that (and (< (mod (+ c_main_~x~0 24) 4294967296) 268435455) (< (mod (+ 20 c_main_~x~0) 4294967296) 268435455) (= |c_#NULL.base| |c_old(#NULL.base)|) (< (mod (+ 6 c_main_~x~0) 4294967296) 268435455) (< (mod (+ c_main_~x~0 54) 4294967296) 268435455) (< (mod (+ 25 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 43 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 14 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 29 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 52 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 48 c_main_~x~0) 4294967296) 268435455) (< (mod (+ c_main_~x~0 27) 4294967296) 268435455) (< (mod (+ 47 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 38 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 56 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 13 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 4 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 34 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 41 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 3 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 53 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 15 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 49 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 58 c_main_~x~0) 4294967296) 268435455) (< (mod c_main_~x~0 4294967296) 268435455) (< (mod (+ 30 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 18 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 40 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 28 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 32 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 35 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 55 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 9 c_main_~x~0) 4294967296) 268435455) (< (mod (+ c_main_~x~0 37) 4294967296) 268435455) (< (mod (+ 42 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 2 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 5 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 44 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 33 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 16 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 39 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 7 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 19 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 8 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 26 c_main_~x~0) 4294967296) 268435455) (< (mod (+ c_main_~x~0 50) 4294967296) 268435455) (< (mod (+ 17 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 23 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 46 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 10 c_main_~x~0) 4294967296) 268435455) (< (mod (+ c_main_~x~0 11) 4294967296) 268435455) (< (mod (+ 31 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 12 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 21 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 57 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 36 c_main_~x~0) 4294967296) 268435455) (= |c_#NULL.offset| |c_old(#NULL.offset)|) (< (mod (+ c_main_~x~0 1) 4294967296) 268435455) (< (mod (+ 45 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 51 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 22 c_main_~x~0) 4294967296) 268435455)) is different from false [2022-01-31 02:28:45,286 WARN L228 SmtUtils]: Spent 21.90s on a formula simplification. DAG size of input: 236 DAG size of output: 12 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-01-31 02:28:47,299 WARN L838 $PredicateComparison]: unable to prove that (and (< (mod (+ c_main_~x~0 24) 4294967296) 268435455) (< (mod (+ 20 c_main_~x~0) 4294967296) 268435455) (= |c_#NULL.base| |c_old(#NULL.base)|) (< (mod (+ 6 c_main_~x~0) 4294967296) 268435455) (< (mod (+ c_main_~x~0 54) 4294967296) 268435455) (< (mod (+ 25 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 43 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 14 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 29 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 52 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 48 c_main_~x~0) 4294967296) 268435455) (< (mod (+ c_main_~x~0 27) 4294967296) 268435455) (< (mod (+ 47 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 38 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 56 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 13 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 4 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 34 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 41 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 3 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 53 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 15 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 49 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 58 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 30 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 18 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 40 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 28 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 32 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 35 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 55 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 9 c_main_~x~0) 4294967296) 268435455) (< (mod (+ c_main_~x~0 37) 4294967296) 268435455) (< (mod (+ 42 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 2 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 5 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 44 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 33 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 16 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 39 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 7 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 19 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 8 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 26 c_main_~x~0) 4294967296) 268435455) (< (mod (+ c_main_~x~0 50) 4294967296) 268435455) (< (mod (+ 17 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 23 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 46 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 10 c_main_~x~0) 4294967296) 268435455) (< (mod (+ c_main_~x~0 11) 4294967296) 268435455) (< (mod (+ 31 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 12 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 21 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 57 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 36 c_main_~x~0) 4294967296) 268435455) (= |c_#NULL.offset| |c_old(#NULL.offset)|) (< (mod (+ c_main_~x~0 1) 4294967296) 268435455) (< (mod (+ 45 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 51 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 22 c_main_~x~0) 4294967296) 268435455)) is different from false [2022-01-31 02:28:49,324 WARN L838 $PredicateComparison]: unable to prove that (and (< (mod (+ c_main_~x~0 24) 4294967296) 268435455) (< (mod (+ 20 c_main_~x~0) 4294967296) 268435455) (= |c_#NULL.base| |c_old(#NULL.base)|) (< (mod (+ 6 c_main_~x~0) 4294967296) 268435455) (< (mod (+ c_main_~x~0 54) 4294967296) 268435455) (< (mod (+ 25 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 43 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 14 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 29 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 52 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 48 c_main_~x~0) 4294967296) 268435455) (< (mod (+ c_main_~x~0 27) 4294967296) 268435455) (< (mod (+ 47 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 38 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 56 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 13 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 4 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 34 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 41 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 3 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 53 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 15 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 49 c_main_~x~0) 4294967296) 268435455) (< (mod c_main_~x~0 4294967296) 268435455) (< (mod (+ 30 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 18 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 40 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 28 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 32 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 35 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 55 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 9 c_main_~x~0) 4294967296) 268435455) (< (mod (+ c_main_~x~0 37) 4294967296) 268435455) (< (mod (+ 42 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 2 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 5 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 44 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 33 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 16 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 39 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 7 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 19 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 8 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 26 c_main_~x~0) 4294967296) 268435455) (< (mod (+ c_main_~x~0 50) 4294967296) 268435455) (< (mod (+ 17 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 23 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 46 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 10 c_main_~x~0) 4294967296) 268435455) (< (mod (+ c_main_~x~0 11) 4294967296) 268435455) (< (mod (+ 31 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 12 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 21 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 57 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 36 c_main_~x~0) 4294967296) 268435455) (= |c_#NULL.offset| |c_old(#NULL.offset)|) (< (mod (+ c_main_~x~0 1) 4294967296) 268435455) (< (mod (+ 45 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 51 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 22 c_main_~x~0) 4294967296) 268435455)) is different from false [2022-01-31 02:28:51,340 WARN L838 $PredicateComparison]: unable to prove that (and (< (mod (+ c_main_~x~0 24) 4294967296) 268435455) (< (mod (+ 20 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 6 c_main_~x~0) 4294967296) 268435455) (< (mod (+ c_main_~x~0 54) 4294967296) 268435455) (< (mod (+ 25 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 43 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 14 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 29 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 52 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 48 c_main_~x~0) 4294967296) 268435455) (< (mod (+ c_main_~x~0 27) 4294967296) 268435455) (< (mod (+ 47 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 38 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 56 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 13 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 4 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 34 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 41 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 3 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 53 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 15 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 49 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 30 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 18 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 40 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 28 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 32 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 35 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 55 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 9 c_main_~x~0) 4294967296) 268435455) (< (mod (+ c_main_~x~0 37) 4294967296) 268435455) (< (mod (+ 42 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 2 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 5 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 44 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 33 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 16 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 39 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 7 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 19 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 8 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 26 c_main_~x~0) 4294967296) 268435455) (< (mod (+ c_main_~x~0 50) 4294967296) 268435455) (< (mod (+ 17 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 23 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 46 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 10 c_main_~x~0) 4294967296) 268435455) (< (mod (+ c_main_~x~0 11) 4294967296) 268435455) (< (mod (+ 31 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 12 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 21 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 57 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 36 c_main_~x~0) 4294967296) 268435455) (< (mod (+ c_main_~x~0 1) 4294967296) 268435455) (< (mod (+ 45 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 51 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 22 c_main_~x~0) 4294967296) 268435455)) is different from false [2022-01-31 02:28:53,353 WARN L838 $PredicateComparison]: unable to prove that (and (< (mod (+ c_main_~x~0 24) 4294967296) 268435455) (< (mod (+ 20 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 6 c_main_~x~0) 4294967296) 268435455) (< (mod (+ c_main_~x~0 54) 4294967296) 268435455) (< (mod (+ 25 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 43 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 14 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 29 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 52 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 48 c_main_~x~0) 4294967296) 268435455) (< (mod (+ c_main_~x~0 27) 4294967296) 268435455) (< (mod (+ 47 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 38 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 56 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 13 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 4 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 34 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 41 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 3 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 53 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 15 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 49 c_main_~x~0) 4294967296) 268435455) (< (mod c_main_~x~0 4294967296) 268435455) (< (mod (+ 30 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 18 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 40 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 28 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 32 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 35 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 55 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 9 c_main_~x~0) 4294967296) 268435455) (< (mod (+ c_main_~x~0 37) 4294967296) 268435455) (< (mod (+ 42 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 2 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 5 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 44 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 33 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 16 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 39 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 7 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 19 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 8 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 26 c_main_~x~0) 4294967296) 268435455) (< (mod (+ c_main_~x~0 50) 4294967296) 268435455) (< (mod (+ 17 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 23 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 46 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 10 c_main_~x~0) 4294967296) 268435455) (< (mod (+ c_main_~x~0 11) 4294967296) 268435455) (< (mod (+ 31 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 12 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 21 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 57 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 36 c_main_~x~0) 4294967296) 268435455) (< (mod (+ c_main_~x~0 1) 4294967296) 268435455) (< (mod (+ 45 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 51 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 22 c_main_~x~0) 4294967296) 268435455)) is different from false [2022-01-31 02:28:55,371 WARN L838 $PredicateComparison]: unable to prove that (and (< (mod (+ c_main_~x~0 24) 4294967296) 268435455) (< (mod (+ 20 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 6 c_main_~x~0) 4294967296) 268435455) (< (mod (+ c_main_~x~0 54) 4294967296) 268435455) (< (mod (+ 25 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 43 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 14 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 29 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 52 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 48 c_main_~x~0) 4294967296) 268435455) (< (mod (+ c_main_~x~0 27) 4294967296) 268435455) (< (mod (+ 47 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 38 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 56 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 13 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 4 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 34 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 41 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 3 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 53 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 15 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 49 c_main_~x~0) 4294967296) 268435455) (< (mod c_main_~x~0 4294967296) 268435455) (< (mod (+ 30 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 18 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 40 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 28 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 32 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 35 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 55 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 9 c_main_~x~0) 4294967296) 268435455) (< (mod (+ c_main_~x~0 37) 4294967296) 268435455) (< (mod (+ 42 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 2 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 5 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 44 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 33 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 16 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 39 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 7 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 19 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 8 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 26 c_main_~x~0) 4294967296) 268435455) (< (mod (+ c_main_~x~0 50) 4294967296) 268435455) (< (mod (+ 17 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 23 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 46 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 10 c_main_~x~0) 4294967296) 268435455) (< (mod (+ c_main_~x~0 11) 4294967296) 268435455) (< (mod (+ 31 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 12 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 21 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 36 c_main_~x~0) 4294967296) 268435455) (< (mod (+ c_main_~x~0 1) 4294967296) 268435455) (< (mod (+ 45 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 51 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 22 c_main_~x~0) 4294967296) 268435455)) is different from false [2022-01-31 02:28:57,384 WARN L838 $PredicateComparison]: unable to prove that (and (< (mod (+ c_main_~x~0 24) 4294967296) 268435455) (< (mod (+ 20 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 6 c_main_~x~0) 4294967296) 268435455) (< (mod (+ c_main_~x~0 54) 4294967296) 268435455) (< (mod (+ 25 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 43 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 14 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 29 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 52 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 48 c_main_~x~0) 4294967296) 268435455) (< (mod (+ c_main_~x~0 27) 4294967296) 268435455) (< (mod (+ 47 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 38 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 56 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 13 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 4 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 34 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 41 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 3 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 53 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 15 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 49 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 30 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 18 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 40 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 28 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 32 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 35 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 55 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 9 c_main_~x~0) 4294967296) 268435455) (< (mod (+ c_main_~x~0 37) 4294967296) 268435455) (< (mod (+ 42 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 2 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 5 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 44 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 33 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 16 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 39 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 7 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 19 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 8 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 26 c_main_~x~0) 4294967296) 268435455) (< (mod (+ c_main_~x~0 50) 4294967296) 268435455) (< (mod (+ 17 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 23 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 46 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 10 c_main_~x~0) 4294967296) 268435455) (< (mod (+ c_main_~x~0 11) 4294967296) 268435455) (< (mod (+ 31 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 12 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 21 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 36 c_main_~x~0) 4294967296) 268435455) (< (mod (+ c_main_~x~0 1) 4294967296) 268435455) (< (mod (+ 45 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 51 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 22 c_main_~x~0) 4294967296) 268435455)) is different from false [2022-01-31 02:28:59,403 WARN L838 $PredicateComparison]: unable to prove that (and (< (mod (+ c_main_~x~0 24) 4294967296) 268435455) (< (mod (+ 20 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 6 c_main_~x~0) 4294967296) 268435455) (< (mod (+ c_main_~x~0 54) 4294967296) 268435455) (< (mod (+ 25 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 43 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 14 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 29 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 52 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 48 c_main_~x~0) 4294967296) 268435455) (< (mod (+ c_main_~x~0 27) 4294967296) 268435455) (< (mod (+ 47 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 38 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 13 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 4 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 34 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 41 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 3 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 53 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 15 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 49 c_main_~x~0) 4294967296) 268435455) (< (mod c_main_~x~0 4294967296) 268435455) (< (mod (+ 30 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 18 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 40 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 28 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 32 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 35 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 55 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 9 c_main_~x~0) 4294967296) 268435455) (< (mod (+ c_main_~x~0 37) 4294967296) 268435455) (< (mod (+ 42 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 2 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 5 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 44 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 33 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 16 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 39 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 7 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 19 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 8 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 26 c_main_~x~0) 4294967296) 268435455) (< (mod (+ c_main_~x~0 50) 4294967296) 268435455) (< (mod (+ 17 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 23 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 46 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 10 c_main_~x~0) 4294967296) 268435455) (< (mod (+ c_main_~x~0 11) 4294967296) 268435455) (< (mod (+ 31 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 12 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 21 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 36 c_main_~x~0) 4294967296) 268435455) (< (mod (+ c_main_~x~0 1) 4294967296) 268435455) (< (mod (+ 45 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 51 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 22 c_main_~x~0) 4294967296) 268435455)) is different from false [2022-01-31 02:29:01,417 WARN L838 $PredicateComparison]: unable to prove that (and (< (mod (+ c_main_~x~0 24) 4294967296) 268435455) (< (mod (+ 20 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 6 c_main_~x~0) 4294967296) 268435455) (< (mod (+ c_main_~x~0 54) 4294967296) 268435455) (< (mod (+ 25 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 43 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 14 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 29 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 52 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 48 c_main_~x~0) 4294967296) 268435455) (< (mod (+ c_main_~x~0 27) 4294967296) 268435455) (< (mod (+ 47 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 38 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 13 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 4 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 34 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 41 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 3 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 53 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 15 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 49 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 30 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 18 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 40 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 28 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 32 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 35 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 55 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 9 c_main_~x~0) 4294967296) 268435455) (< (mod (+ c_main_~x~0 37) 4294967296) 268435455) (< (mod (+ 42 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 2 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 5 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 44 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 33 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 16 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 39 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 7 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 19 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 8 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 26 c_main_~x~0) 4294967296) 268435455) (< (mod (+ c_main_~x~0 50) 4294967296) 268435455) (< (mod (+ 17 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 23 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 46 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 10 c_main_~x~0) 4294967296) 268435455) (< (mod (+ c_main_~x~0 11) 4294967296) 268435455) (< (mod (+ 31 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 12 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 21 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 36 c_main_~x~0) 4294967296) 268435455) (< (mod (+ c_main_~x~0 1) 4294967296) 268435455) (< (mod (+ 45 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 51 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 22 c_main_~x~0) 4294967296) 268435455)) is different from false