/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/loops-crafted-1/nested5-2.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-d966a43 [2022-01-31 03:12:29,093 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-01-31 03:12:29,095 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-01-31 03:12:29,150 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-01-31 03:12:29,151 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-01-31 03:12:29,153 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-01-31 03:12:29,155 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-01-31 03:12:29,157 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-01-31 03:12:29,158 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-01-31 03:12:29,162 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-01-31 03:12:29,163 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-01-31 03:12:29,164 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-01-31 03:12:29,164 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-01-31 03:12:29,165 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-01-31 03:12:29,168 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-01-31 03:12:29,170 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-01-31 03:12:29,170 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-01-31 03:12:29,171 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-01-31 03:12:29,172 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-01-31 03:12:29,176 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-01-31 03:12:29,177 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-01-31 03:12:29,178 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-01-31 03:12:29,179 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-01-31 03:12:29,179 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-01-31 03:12:29,184 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-01-31 03:12:29,185 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-01-31 03:12:29,185 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-01-31 03:12:29,186 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-01-31 03:12:29,186 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-01-31 03:12:29,187 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-01-31 03:12:29,187 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-01-31 03:12:29,187 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-01-31 03:12:29,189 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-01-31 03:12:29,189 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-01-31 03:12:29,190 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-01-31 03:12:29,190 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-01-31 03:12:29,191 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-01-31 03:12:29,191 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-01-31 03:12:29,191 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-01-31 03:12:29,191 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-01-31 03:12:29,192 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-01-31 03:12:29,192 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 03:12:29,215 INFO L113 SettingsManager]: Loading preferences was successful [2022-01-31 03:12:29,215 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-01-31 03:12:29,216 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-01-31 03:12:29,216 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-01-31 03:12:29,216 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-01-31 03:12:29,216 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-01-31 03:12:29,217 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-01-31 03:12:29,217 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-01-31 03:12:29,217 INFO L138 SettingsManager]: * Use SBE=true [2022-01-31 03:12:29,217 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-01-31 03:12:29,218 INFO L138 SettingsManager]: * sizeof long=4 [2022-01-31 03:12:29,218 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-01-31 03:12:29,218 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-01-31 03:12:29,218 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-01-31 03:12:29,218 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-01-31 03:12:29,218 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-01-31 03:12:29,218 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-01-31 03:12:29,219 INFO L138 SettingsManager]: * sizeof long double=12 [2022-01-31 03:12:29,219 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-01-31 03:12:29,219 INFO L138 SettingsManager]: * Use constant arrays=true [2022-01-31 03:12:29,219 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-01-31 03:12:29,219 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-01-31 03:12:29,219 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-01-31 03:12:29,219 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-01-31 03:12:29,220 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-31 03:12:29,220 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-01-31 03:12:29,220 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-01-31 03:12:29,221 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-01-31 03:12:29,221 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-01-31 03:12:29,221 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-01-31 03:12:29,221 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-01-31 03:12:29,221 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-01-31 03:12:29,221 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-01-31 03:12:29,221 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 03:12:29,418 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-01-31 03:12:29,447 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-01-31 03:12:29,448 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-01-31 03:12:29,449 INFO L271 PluginConnector]: Initializing CDTParser... [2022-01-31 03:12:29,450 INFO L275 PluginConnector]: CDTParser initialized [2022-01-31 03:12:29,451 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops-crafted-1/nested5-2.c [2022-01-31 03:12:29,506 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a34cb475f/d40bfc3d4ff144b9b8765830cfc6a15f/FLAGa47717f0c [2022-01-31 03:12:29,804 INFO L306 CDTParser]: Found 1 translation units. [2022-01-31 03:12:29,804 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops-crafted-1/nested5-2.c [2022-01-31 03:12:29,810 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a34cb475f/d40bfc3d4ff144b9b8765830cfc6a15f/FLAGa47717f0c [2022-01-31 03:12:30,236 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a34cb475f/d40bfc3d4ff144b9b8765830cfc6a15f [2022-01-31 03:12:30,241 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-01-31 03:12:30,243 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-01-31 03:12:30,246 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-01-31 03:12:30,246 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-01-31 03:12:30,248 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-01-31 03:12:30,249 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.01 03:12:30" (1/1) ... [2022-01-31 03:12:30,250 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@62013f02 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 03:12:30, skipping insertion in model container [2022-01-31 03:12:30,251 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.01 03:12:30" (1/1) ... [2022-01-31 03:12:30,255 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-01-31 03:12:30,264 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-01-31 03:12:30,416 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loops-crafted-1/nested5-2.c[321,334] [2022-01-31 03:12:30,430 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-31 03:12:30,435 INFO L203 MainTranslator]: Completed pre-run [2022-01-31 03:12:30,444 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loops-crafted-1/nested5-2.c[321,334] [2022-01-31 03:12:30,451 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-31 03:12:30,464 INFO L208 MainTranslator]: Completed translation [2022-01-31 03:12:30,465 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 03:12:30 WrapperNode [2022-01-31 03:12:30,465 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-01-31 03:12:30,466 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-01-31 03:12:30,466 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-01-31 03:12:30,466 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-01-31 03:12:30,473 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 03:12:30" (1/1) ... [2022-01-31 03:12:30,473 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 03:12:30" (1/1) ... [2022-01-31 03:12:30,478 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 03:12:30" (1/1) ... [2022-01-31 03:12:30,479 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 03:12:30" (1/1) ... [2022-01-31 03:12:30,487 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 03:12:30" (1/1) ... [2022-01-31 03:12:30,492 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 03:12:30" (1/1) ... [2022-01-31 03:12:30,495 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 03:12:30" (1/1) ... [2022-01-31 03:12:30,497 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-01-31 03:12:30,498 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-01-31 03:12:30,498 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-01-31 03:12:30,498 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-01-31 03:12:30,499 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 03:12:30" (1/1) ... [2022-01-31 03:12:30,503 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-31 03:12:30,510 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 03:12:30,520 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 03:12:30,568 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 03:12:30,593 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-01-31 03:12:30,593 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-01-31 03:12:30,593 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-01-31 03:12:30,593 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-01-31 03:12:30,594 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-01-31 03:12:30,594 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-01-31 03:12:30,594 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-01-31 03:12:30,594 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-01-31 03:12:30,595 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-01-31 03:12:30,595 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-01-31 03:12:30,595 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-01-31 03:12:30,595 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-01-31 03:12:30,595 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-01-31 03:12:30,595 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-01-31 03:12:30,595 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-01-31 03:12:30,595 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-01-31 03:12:30,595 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-01-31 03:12:30,638 INFO L234 CfgBuilder]: Building ICFG [2022-01-31 03:12:30,639 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-01-31 03:12:30,723 INFO L275 CfgBuilder]: Performing block encoding [2022-01-31 03:12:30,727 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-01-31 03:12:30,727 INFO L299 CfgBuilder]: Removed 5 assume(true) statements. [2022-01-31 03:12:30,728 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.01 03:12:30 BoogieIcfgContainer [2022-01-31 03:12:30,728 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-01-31 03:12:30,729 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-01-31 03:12:30,729 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-01-31 03:12:30,732 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-01-31 03:12:30,732 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 31.01 03:12:30" (1/3) ... [2022-01-31 03:12:30,733 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@623525d4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.01 03:12:30, skipping insertion in model container [2022-01-31 03:12:30,733 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 03:12:30" (2/3) ... [2022-01-31 03:12:30,733 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@623525d4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.01 03:12:30, skipping insertion in model container [2022-01-31 03:12:30,733 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.01 03:12:30" (3/3) ... [2022-01-31 03:12:30,734 INFO L111 eAbstractionObserver]: Analyzing ICFG nested5-2.c [2022-01-31 03:12:30,737 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-01-31 03:12:30,738 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-01-31 03:12:30,768 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-01-31 03:12:30,772 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 03:12:30,772 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-01-31 03:12:30,782 INFO L276 IsEmpty]: Start isEmpty. Operand has 28 states, 20 states have (on average 1.6) internal successors, (32), 21 states have internal predecessors, (32), 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 03:12:30,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-01-31 03:12:30,786 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 03:12:30,786 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 03:12:30,787 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 03:12:30,793 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 03:12:30,794 INFO L85 PathProgramCache]: Analyzing trace with hash -531959740, now seen corresponding path program 1 times [2022-01-31 03:12:30,799 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 03:12:30,800 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1228166910] [2022-01-31 03:12:30,800 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 03:12:30,801 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 03:12:30,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 03:12:30,955 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 03:12:30,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 03:12:30,977 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 03:12:30,977 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 03:12:30,978 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1228166910] [2022-01-31 03:12:30,978 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1228166910] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 03:12:30,978 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 03:12:30,978 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-31 03:12:30,979 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1073673209] [2022-01-31 03:12:30,980 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 03:12:30,982 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-31 03:12:30,982 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 03:12:31,013 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-31 03:12:31,014 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-31 03:12:31,015 INFO L87 Difference]: Start difference. First operand has 28 states, 20 states have (on average 1.6) internal successors, (32), 21 states have internal predecessors, (32), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 03:12:31,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 03:12:31,064 INFO L93 Difference]: Finished difference Result 50 states and 71 transitions. [2022-01-31 03:12:31,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-31 03:12:31,066 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2022-01-31 03:12:31,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 03:12:31,069 INFO L225 Difference]: With dead ends: 50 [2022-01-31 03:12:31,070 INFO L226 Difference]: Without dead ends: 23 [2022-01-31 03:12:31,071 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-31 03:12:31,074 INFO L933 BasicCegarLoop]: 31 mSDtfsCounter, 23 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-31 03:12:31,074 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [24 Valid, 34 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-31 03:12:31,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2022-01-31 03:12:31,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2022-01-31 03:12:31,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 17 states have (on average 1.2941176470588236) internal successors, (22), 17 states have internal predecessors, (22), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-01-31 03:12:31,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 27 transitions. [2022-01-31 03:12:31,105 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 27 transitions. Word has length 15 [2022-01-31 03:12:31,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 03:12:31,105 INFO L470 AbstractCegarLoop]: Abstraction has 23 states and 27 transitions. [2022-01-31 03:12:31,105 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 03:12:31,105 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 27 transitions. [2022-01-31 03:12:31,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-01-31 03:12:31,106 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 03:12:31,106 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 03:12:31,106 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-01-31 03:12:31,107 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 03:12:31,109 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 03:12:31,109 INFO L85 PathProgramCache]: Analyzing trace with hash -537500866, now seen corresponding path program 1 times [2022-01-31 03:12:31,109 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 03:12:31,110 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1182314918] [2022-01-31 03:12:31,110 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 03:12:31,110 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 03:12:31,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 03:12:31,222 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 03:12:31,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 03:12:31,239 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 03:12:31,240 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 03:12:31,240 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1182314918] [2022-01-31 03:12:31,241 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1182314918] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 03:12:31,241 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 03:12:31,241 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-31 03:12:31,242 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1700116839] [2022-01-31 03:12:31,242 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 03:12:31,244 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-31 03:12:31,244 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 03:12:31,246 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-31 03:12:31,246 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-31 03:12:31,247 INFO L87 Difference]: Start difference. First operand 23 states and 27 transitions. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 03:12:31,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 03:12:31,307 INFO L93 Difference]: Finished difference Result 49 states and 61 transitions. [2022-01-31 03:12:31,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-01-31 03:12:31,309 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2022-01-31 03:12:31,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 03:12:31,310 INFO L225 Difference]: With dead ends: 49 [2022-01-31 03:12:31,310 INFO L226 Difference]: Without dead ends: 32 [2022-01-31 03:12:31,313 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 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 03:12:31,315 INFO L933 BasicCegarLoop]: 24 mSDtfsCounter, 41 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-31 03:12:31,315 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [42 Valid, 31 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-31 03:12:31,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2022-01-31 03:12:31,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 24. [2022-01-31 03:12:31,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 18 states have (on average 1.2777777777777777) internal successors, (23), 18 states have internal predecessors, (23), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-01-31 03:12:31,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 28 transitions. [2022-01-31 03:12:31,326 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 28 transitions. Word has length 15 [2022-01-31 03:12:31,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 03:12:31,326 INFO L470 AbstractCegarLoop]: Abstraction has 24 states and 28 transitions. [2022-01-31 03:12:31,327 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 03:12:31,327 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 28 transitions. [2022-01-31 03:12:31,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-01-31 03:12:31,331 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 03:12:31,331 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 03:12:31,331 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-01-31 03:12:31,332 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 03:12:31,332 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 03:12:31,332 INFO L85 PathProgramCache]: Analyzing trace with hash -509289700, now seen corresponding path program 1 times [2022-01-31 03:12:31,332 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 03:12:31,332 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [974343452] [2022-01-31 03:12:31,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 03:12:31,333 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 03:12:31,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 03:12:31,386 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 03:12:31,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 03:12:31,390 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 03:12:31,391 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 03:12:31,391 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [974343452] [2022-01-31 03:12:31,391 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [974343452] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-31 03:12:31,391 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [960071898] [2022-01-31 03:12:31,391 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 03:12:31,391 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 03:12:31,392 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 03:12:31,393 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 03:12:31,447 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 03:12:31,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 03:12:31,458 INFO L263 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 5 conjunts are in the unsatisfiable core [2022-01-31 03:12:31,461 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 03:12:31,508 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 03:12:31,508 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 03:12:31,588 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 03:12:31,588 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [960071898] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 03:12:31,588 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-31 03:12:31,589 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 8 [2022-01-31 03:12:31,589 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1475924706] [2022-01-31 03:12:31,589 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-31 03:12:31,589 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-01-31 03:12:31,589 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 03:12:31,590 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-01-31 03:12:31,590 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2022-01-31 03:12:31,590 INFO L87 Difference]: Start difference. First operand 24 states and 28 transitions. Second operand has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 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 03:12:31,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 03:12:31,712 INFO L93 Difference]: Finished difference Result 55 states and 69 transitions. [2022-01-31 03:12:31,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-01-31 03:12:31,713 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 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 17 [2022-01-31 03:12:31,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 03:12:31,713 INFO L225 Difference]: With dead ends: 55 [2022-01-31 03:12:31,713 INFO L226 Difference]: Without dead ends: 37 [2022-01-31 03:12:31,714 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 35 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 03:12:31,714 INFO L933 BasicCegarLoop]: 24 mSDtfsCounter, 57 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-31 03:12:31,715 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [58 Valid, 36 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-31 03:12:31,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2022-01-31 03:12:31,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 30. [2022-01-31 03:12:31,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 24 states have internal predecessors, (29), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-01-31 03:12:31,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 34 transitions. [2022-01-31 03:12:31,719 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 34 transitions. Word has length 17 [2022-01-31 03:12:31,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 03:12:31,719 INFO L470 AbstractCegarLoop]: Abstraction has 30 states and 34 transitions. [2022-01-31 03:12:31,719 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 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 03:12:31,719 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 34 transitions. [2022-01-31 03:12:31,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-01-31 03:12:31,720 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 03:12:31,720 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 03:12:31,741 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 03:12:31,926 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 03:12:31,927 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 03:12:31,927 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 03:12:31,927 INFO L85 PathProgramCache]: Analyzing trace with hash -1312242250, now seen corresponding path program 2 times [2022-01-31 03:12:31,927 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 03:12:31,927 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [963132901] [2022-01-31 03:12:31,928 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 03:12:31,928 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 03:12:31,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 03:12:32,034 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 03:12:32,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 03:12:32,048 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 03:12:32,048 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 03:12:32,048 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [963132901] [2022-01-31 03:12:32,049 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [963132901] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-31 03:12:32,049 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2053005439] [2022-01-31 03:12:32,049 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-01-31 03:12:32,049 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 03:12:32,049 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 03:12:32,050 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 03:12:32,051 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 03:12:32,082 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-01-31 03:12:32,083 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-31 03:12:32,083 INFO L263 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 11 conjunts are in the unsatisfiable core [2022-01-31 03:12:32,085 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 03:12:32,191 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 03:12:32,192 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 03:12:32,290 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 03:12:32,290 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2053005439] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 03:12:32,290 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-31 03:12:32,291 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 14 [2022-01-31 03:12:32,291 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [705709929] [2022-01-31 03:12:32,291 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-31 03:12:32,291 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-01-31 03:12:32,291 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 03:12:32,292 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-01-31 03:12:32,292 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=122, Unknown=0, NotChecked=0, Total=182 [2022-01-31 03:12:32,292 INFO L87 Difference]: Start difference. First operand 30 states and 34 transitions. Second operand has 14 states, 14 states have (on average 2.2857142857142856) internal successors, (32), 13 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 03:12:32,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 03:12:32,679 INFO L93 Difference]: Finished difference Result 73 states and 90 transitions. [2022-01-31 03:12:32,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-01-31 03:12:32,680 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.2857142857142856) internal successors, (32), 13 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 23 [2022-01-31 03:12:32,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 03:12:32,681 INFO L225 Difference]: With dead ends: 73 [2022-01-31 03:12:32,681 INFO L226 Difference]: Without dead ends: 49 [2022-01-31 03:12:32,681 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 43 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=175, Invalid=377, Unknown=0, NotChecked=0, Total=552 [2022-01-31 03:12:32,682 INFO L933 BasicCegarLoop]: 24 mSDtfsCounter, 85 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 197 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 51 SdHoareTripleChecker+Invalid, 226 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 197 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-31 03:12:32,682 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [86 Valid, 51 Invalid, 226 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 197 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-31 03:12:32,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2022-01-31 03:12:32,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 42. [2022-01-31 03:12:32,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 36 states have (on average 1.1388888888888888) internal successors, (41), 36 states have internal predecessors, (41), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-01-31 03:12:32,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 46 transitions. [2022-01-31 03:12:32,688 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 46 transitions. Word has length 23 [2022-01-31 03:12:32,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 03:12:32,688 INFO L470 AbstractCegarLoop]: Abstraction has 42 states and 46 transitions. [2022-01-31 03:12:32,688 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.2857142857142856) internal successors, (32), 13 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 03:12:32,688 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 46 transitions. [2022-01-31 03:12:32,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-01-31 03:12:32,689 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 03:12:32,689 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 03:12:32,721 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-01-31 03:12:32,903 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 03:12:32,903 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 03:12:32,904 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 03:12:32,904 INFO L85 PathProgramCache]: Analyzing trace with hash -759453590, now seen corresponding path program 3 times [2022-01-31 03:12:32,904 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 03:12:32,904 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1975020142] [2022-01-31 03:12:32,904 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 03:12:32,904 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 03:12:32,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 03:12:33,040 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 03:12:33,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 03:12:33,046 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 03:12:33,046 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 03:12:33,046 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1975020142] [2022-01-31 03:12:33,046 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1975020142] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-31 03:12:33,047 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1366113284] [2022-01-31 03:12:33,047 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-01-31 03:12:33,047 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 03:12:33,047 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 03:12:33,064 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 03:12:33,107 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 03:12:33,121 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2022-01-31 03:12:33,121 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-31 03:12:33,122 INFO L263 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 23 conjunts are in the unsatisfiable core [2022-01-31 03:12:33,123 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 03:12:33,252 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 03:12:33,252 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 03:12:33,512 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 03:12:33,513 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1366113284] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 03:12:33,513 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-31 03:12:33,513 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13, 13] total 26 [2022-01-31 03:12:33,513 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [964602759] [2022-01-31 03:12:33,513 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-31 03:12:33,514 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-01-31 03:12:33,514 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 03:12:33,514 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-01-31 03:12:33,514 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=192, Invalid=458, Unknown=0, NotChecked=0, Total=650 [2022-01-31 03:12:33,515 INFO L87 Difference]: Start difference. First operand 42 states and 46 transitions. Second operand has 26 states, 26 states have (on average 2.1538461538461537) internal successors, (56), 25 states have internal predecessors, (56), 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 03:12:36,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 03:12:36,605 INFO L93 Difference]: Finished difference Result 109 states and 132 transitions. [2022-01-31 03:12:36,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-01-31 03:12:36,606 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 2.1538461538461537) internal successors, (56), 25 states have internal predecessors, (56), 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 35 [2022-01-31 03:12:36,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 03:12:36,608 INFO L225 Difference]: With dead ends: 109 [2022-01-31 03:12:36,608 INFO L226 Difference]: Without dead ends: 73 [2022-01-31 03:12:36,610 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 61 SyntacticMatches, 1 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 268 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=643, Invalid=1613, Unknown=0, NotChecked=0, Total=2256 [2022-01-31 03:12:36,611 INFO L933 BasicCegarLoop]: 24 mSDtfsCounter, 128 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 570 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 129 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 634 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 570 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-01-31 03:12:36,612 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [129 Valid, 81 Invalid, 634 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 570 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-01-31 03:12:36,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2022-01-31 03:12:36,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 66. [2022-01-31 03:12:36,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 60 states have (on average 1.0833333333333333) internal successors, (65), 60 states have internal predecessors, (65), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-01-31 03:12:36,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 70 transitions. [2022-01-31 03:12:36,622 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 70 transitions. Word has length 35 [2022-01-31 03:12:36,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 03:12:36,622 INFO L470 AbstractCegarLoop]: Abstraction has 66 states and 70 transitions. [2022-01-31 03:12:36,622 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 2.1538461538461537) internal successors, (56), 25 states have internal predecessors, (56), 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 03:12:36,622 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 70 transitions. [2022-01-31 03:12:36,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-01-31 03:12:36,635 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 03:12:36,635 INFO L514 BasicCegarLoop]: trace histogram [22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 03:12:36,653 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-01-31 03:12:36,835 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 03:12:36,836 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 03:12:36,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 03:12:36,836 INFO L85 PathProgramCache]: Analyzing trace with hash -110156846, now seen corresponding path program 4 times [2022-01-31 03:12:36,836 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 03:12:36,836 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1783318808] [2022-01-31 03:12:36,836 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 03:12:36,836 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 03:12:36,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 03:12:37,228 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 03:12:37,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 03:12:37,243 INFO L134 CoverageAnalysis]: Checked inductivity of 484 backedges. 0 proven. 484 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 03:12:37,243 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 03:12:37,244 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1783318808] [2022-01-31 03:12:37,244 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1783318808] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-31 03:12:37,245 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1521765247] [2022-01-31 03:12:37,245 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-01-31 03:12:37,246 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 03:12:37,246 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 03:12:37,247 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 03:12:37,264 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 03:12:37,337 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-01-31 03:12:37,337 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-31 03:12:37,338 INFO L263 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 47 conjunts are in the unsatisfiable core [2022-01-31 03:12:37,340 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 03:12:37,565 INFO L134 CoverageAnalysis]: Checked inductivity of 484 backedges. 0 proven. 484 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 03:12:37,565 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 03:12:38,291 INFO L134 CoverageAnalysis]: Checked inductivity of 484 backedges. 0 proven. 484 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 03:12:38,291 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1521765247] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 03:12:38,291 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-31 03:12:38,291 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 25, 25] total 50 [2022-01-31 03:12:38,292 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2052924686] [2022-01-31 03:12:38,292 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-31 03:12:38,292 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2022-01-31 03:12:38,292 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 03:12:38,293 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2022-01-31 03:12:38,294 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=672, Invalid=1778, Unknown=0, NotChecked=0, Total=2450 [2022-01-31 03:12:38,294 INFO L87 Difference]: Start difference. First operand 66 states and 70 transitions. Second operand has 50 states, 50 states have (on average 2.08) internal successors, (104), 49 states have internal predecessors, (104), 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 03:14:38,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 03:14:38,380 INFO L93 Difference]: Finished difference Result 181 states and 216 transitions. [2022-01-31 03:14:38,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2022-01-31 03:14:38,380 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 50 states have (on average 2.08) internal successors, (104), 49 states have internal predecessors, (104), 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 59 [2022-01-31 03:14:38,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 03:14:38,381 INFO L225 Difference]: With dead ends: 181 [2022-01-31 03:14:38,381 INFO L226 Difference]: Without dead ends: 121 [2022-01-31 03:14:38,384 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 192 GetRequests, 97 SyntacticMatches, 1 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1116 ImplicationChecksByTransitivity, 120.3s TimeCoverageRelationStatistics Valid=2441, Invalid=6677, Unknown=2, NotChecked=0, Total=9120 [2022-01-31 03:14:38,384 INFO L933 BasicCegarLoop]: 24 mSDtfsCounter, 221 mSDsluCounter, 117 mSDsCounter, 0 mSdLazyCounter, 1760 mSolverCounterSat, 136 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 222 SdHoareTripleChecker+Valid, 141 SdHoareTripleChecker+Invalid, 1896 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 136 IncrementalHoareTripleChecker+Valid, 1760 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-01-31 03:14:38,384 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [222 Valid, 141 Invalid, 1896 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [136 Valid, 1760 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-01-31 03:14:38,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2022-01-31 03:14:38,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 114. [2022-01-31 03:14:38,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 108 states have (on average 1.0462962962962963) internal successors, (113), 108 states have internal predecessors, (113), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-01-31 03:14:38,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 118 transitions. [2022-01-31 03:14:38,393 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 118 transitions. Word has length 59 [2022-01-31 03:14:38,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 03:14:38,393 INFO L470 AbstractCegarLoop]: Abstraction has 114 states and 118 transitions. [2022-01-31 03:14:38,393 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 50 states have (on average 2.08) internal successors, (104), 49 states have internal predecessors, (104), 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 03:14:38,393 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 118 transitions. [2022-01-31 03:14:38,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2022-01-31 03:14:38,394 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 03:14:38,394 INFO L514 BasicCegarLoop]: trace histogram [46, 46, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 03:14:38,426 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 03:14:38,595 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 03:14:38,595 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 03:14:38,595 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 03:14:38,595 INFO L85 PathProgramCache]: Analyzing trace with hash -1588006238, now seen corresponding path program 5 times [2022-01-31 03:14:38,595 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 03:14:38,596 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1811496226] [2022-01-31 03:14:38,596 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 03:14:38,596 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 03:14:38,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 03:14:39,731 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 03:14:39,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 03:14:39,735 INFO L134 CoverageAnalysis]: Checked inductivity of 2116 backedges. 0 proven. 2116 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 03:14:39,736 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 03:14:39,736 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1811496226] [2022-01-31 03:14:39,736 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1811496226] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-31 03:14:39,748 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [617340535] [2022-01-31 03:14:39,749 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-01-31 03:14:39,749 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 03:14:39,749 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 03:14:39,751 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 03:14:39,752 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 03:17:02,015 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 47 check-sat command(s) [2022-01-31 03:17:02,016 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-31 03:17:02,085 INFO L263 TraceCheckSpWp]: Trace formula consists of 209 conjuncts, 95 conjunts are in the unsatisfiable core [2022-01-31 03:17:02,087 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 03:17:02,578 INFO L134 CoverageAnalysis]: Checked inductivity of 2116 backedges. 0 proven. 2116 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 03:17:02,581 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 03:17:05,282 INFO L134 CoverageAnalysis]: Checked inductivity of 2116 backedges. 0 proven. 2116 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 03:17:05,282 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [617340535] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 03:17:05,282 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-31 03:17:05,283 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [50, 49, 49] total 98 [2022-01-31 03:17:05,283 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1426737982] [2022-01-31 03:17:05,283 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-31 03:17:05,284 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 98 states [2022-01-31 03:17:05,284 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 03:17:05,286 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 98 interpolants. [2022-01-31 03:17:05,305 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=2496, Invalid=7010, Unknown=0, NotChecked=0, Total=9506 [2022-01-31 03:17:05,305 INFO L87 Difference]: Start difference. First operand 114 states and 118 transitions. Second operand has 98 states, 98 states have (on average 2.0408163265306123) internal successors, (200), 97 states have internal predecessors, (200), 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 03:17:09,549 WARN L838 $PredicateComparison]: unable to prove that (and (= |c_#NULL.base| |c_old(#NULL.base)|) (< (mod (+ c_main_~v~0 39) 4294967296) 268435455) (< (mod (+ 7 c_main_~v~0) 4294967296) 268435455) (< (mod (+ c_main_~v~0 24) 4294967296) 268435455) (< (mod (+ c_main_~v~0 36) 4294967296) 268435455) (< (mod (+ 44 c_main_~v~0) 4294967296) 268435455) (< (mod (+ c_main_~v~0 6) 4294967296) 268435455) (< (mod (+ c_main_~v~0 17) 4294967296) 268435455) (< (mod (+ c_main_~v~0 13) 4294967296) 268435455) (< (mod (+ c_main_~v~0 18) 4294967296) 268435455) (< (mod (+ 32 c_main_~v~0) 4294967296) 268435455) (< (mod (+ c_main_~v~0 28) 4294967296) 268435455) (< (mod (+ c_main_~v~0 20) 4294967296) 268435455) (< (mod (+ 29 c_main_~v~0) 4294967296) 268435455) (< (mod (+ 22 c_main_~v~0) 4294967296) 268435455) (< (mod c_main_~v~0 4294967296) 268435455) (< (mod (+ c_main_~v~0 38) 4294967296) 268435455) (< (mod (+ 9 c_main_~v~0) 4294967296) 268435455) (< (mod (+ c_main_~v~0 4) 4294967296) 268435455) (< (mod (+ c_main_~v~0 26) 4294967296) 268435455) (< (mod (+ 30 c_main_~v~0) 4294967296) 268435455) (< (mod (+ c_main_~v~0 10) 4294967296) 268435455) (< (mod (+ 19 c_main_~v~0) 4294967296) 268435455) (< (mod (+ 40 c_main_~v~0) 4294967296) 268435455) (< (mod (+ 35 c_main_~v~0) 4294967296) 268435455) (< (mod (+ c_main_~v~0 25) 4294967296) 268435455) (< (mod (+ 42 c_main_~v~0) 4294967296) 268435455) (< (mod (+ c_main_~v~0 34) 4294967296) 268435455) (< (mod (+ c_main_~v~0 43) 4294967296) 268435455) (< (mod (+ c_main_~v~0 31) 4294967296) 268435455) (< (mod (+ 23 c_main_~v~0) 4294967296) 268435455) (< (mod (+ c_main_~v~0 1) 4294967296) 268435455) (< (mod (+ c_main_~v~0 46) 4294967296) 268435455) (< (mod (+ 14 c_main_~v~0) 4294967296) 268435455) (< (mod (+ c_main_~v~0 37) 4294967296) 268435455) (< (mod (+ c_main_~v~0 12) 4294967296) 268435455) (< (mod (+ c_main_~v~0 33) 4294967296) 268435455) (< (mod (+ 16 c_main_~v~0) 4294967296) 268435455) (< (mod (+ 2 c_main_~v~0) 4294967296) 268435455) (< (mod (+ c_main_~v~0 45) 4294967296) 268435455) (< (mod (+ c_main_~v~0 11) 4294967296) 268435455) (< (mod (+ c_main_~v~0 15) 4294967296) 268435455) (< (mod (+ 5 c_main_~v~0) 4294967296) 268435455) (< (mod (+ c_main_~v~0 8) 4294967296) 268435455) (< (mod (+ 41 c_main_~v~0) 4294967296) 268435455) (< (mod (+ c_main_~v~0 27) 4294967296) 268435455) (= |c_#NULL.offset| |c_old(#NULL.offset)|) (< (mod (+ 3 c_main_~v~0) 4294967296) 268435455) (< (mod (+ 21 c_main_~v~0) 4294967296) 268435455)) is different from false [2022-01-31 03:17:55,420 WARN L228 SmtUtils]: Spent 9.37s on a formula simplification. DAG size of input: 188 DAG size of output: 12 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-01-31 03:18:43,167 WARN L228 SmtUtils]: Spent 13.75s on a formula simplification. DAG size of input: 192 DAG size of output: 16 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-01-31 03:19:39,368 WARN L228 SmtUtils]: Spent 10.21s on a formula simplification. DAG size of input: 188 DAG size of output: 16 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-01-31 03:19:41,437 WARN L838 $PredicateComparison]: unable to prove that (and (= |c_#NULL.base| |c_old(#NULL.base)|) (< (mod (+ c_main_~v~0 39) 4294967296) 268435455) (< (mod (+ 7 c_main_~v~0) 4294967296) 268435455) (< (mod (+ c_main_~v~0 24) 4294967296) 268435455) (< (mod (+ c_main_~v~0 36) 4294967296) 268435455) (< (mod (+ c_main_~v~0 6) 4294967296) 268435455) (< (mod (+ c_main_~v~0 17) 4294967296) 268435455) (< (mod (+ c_main_~v~0 13) 4294967296) 268435455) (< (mod (+ c_main_~v~0 18) 4294967296) 268435455) (< (mod (+ 32 c_main_~v~0) 4294967296) 268435455) (< (mod (+ c_main_~v~0 28) 4294967296) 268435455) (< (mod (+ c_main_~v~0 20) 4294967296) 268435455) (< (mod (+ 29 c_main_~v~0) 4294967296) 268435455) (< (mod (+ 22 c_main_~v~0) 4294967296) 268435455) (< (mod c_main_~v~0 4294967296) 268435455) (< (mod (+ c_main_~v~0 38) 4294967296) 268435455) (< (mod (+ 9 c_main_~v~0) 4294967296) 268435455) (< (mod (+ c_main_~v~0 4) 4294967296) 268435455) (< (mod (+ c_main_~v~0 26) 4294967296) 268435455) (< (mod (+ 30 c_main_~v~0) 4294967296) 268435455) (< (mod (+ c_main_~v~0 10) 4294967296) 268435455) (< (mod (+ 19 c_main_~v~0) 4294967296) 268435455) (< (mod (+ 40 c_main_~v~0) 4294967296) 268435455) (< (mod (+ 35 c_main_~v~0) 4294967296) 268435455) (< (mod (+ c_main_~v~0 25) 4294967296) 268435455) (< (mod (+ 42 c_main_~v~0) 4294967296) 268435455) (< (mod (+ c_main_~v~0 34) 4294967296) 268435455) (< (mod (+ c_main_~v~0 43) 4294967296) 268435455) (< (mod (+ c_main_~v~0 31) 4294967296) 268435455) (< (mod (+ 23 c_main_~v~0) 4294967296) 268435455) (< (mod (+ c_main_~v~0 1) 4294967296) 268435455) (< (mod (+ 14 c_main_~v~0) 4294967296) 268435455) (< (mod (+ c_main_~v~0 37) 4294967296) 268435455) (< (mod (+ c_main_~v~0 12) 4294967296) 268435455) (< (mod (+ c_main_~v~0 33) 4294967296) 268435455) (< (mod (+ 16 c_main_~v~0) 4294967296) 268435455) (< (mod (+ 2 c_main_~v~0) 4294967296) 268435455) (< (mod (+ c_main_~v~0 11) 4294967296) 268435455) (< (mod (+ c_main_~v~0 15) 4294967296) 268435455) (< (mod (+ 5 c_main_~v~0) 4294967296) 268435455) (< (mod (+ c_main_~v~0 8) 4294967296) 268435455) (< (mod (+ 41 c_main_~v~0) 4294967296) 268435455) (< (mod (+ c_main_~v~0 27) 4294967296) 268435455) (= |c_#NULL.offset| |c_old(#NULL.offset)|) (< (mod (+ 3 c_main_~v~0) 4294967296) 268435455) (< (mod (+ 21 c_main_~v~0) 4294967296) 268435455)) is different from false [2022-01-31 03:19:43,448 WARN L838 $PredicateComparison]: unable to prove that (and (< (mod (+ c_main_~v~0 39) 4294967296) 268435455) (< (mod (+ 7 c_main_~v~0) 4294967296) 268435455) (< (mod (+ c_main_~v~0 24) 4294967296) 268435455) (< (mod (+ c_main_~v~0 36) 4294967296) 268435455) (< (mod (+ c_main_~v~0 6) 4294967296) 268435455) (< (mod (+ c_main_~v~0 17) 4294967296) 268435455) (< (mod (+ c_main_~v~0 13) 4294967296) 268435455) (< (mod (+ c_main_~v~0 18) 4294967296) 268435455) (< (mod (+ 32 c_main_~v~0) 4294967296) 268435455) (< (mod (+ c_main_~v~0 28) 4294967296) 268435455) (< (mod (+ c_main_~v~0 20) 4294967296) 268435455) (< (mod (+ 29 c_main_~v~0) 4294967296) 268435455) (< (mod (+ 22 c_main_~v~0) 4294967296) 268435455) (< (mod (+ c_main_~v~0 38) 4294967296) 268435455) (< (mod (+ 9 c_main_~v~0) 4294967296) 268435455) (< (mod (+ c_main_~v~0 4) 4294967296) 268435455) (< (mod (+ c_main_~v~0 26) 4294967296) 268435455) (< (mod (+ 30 c_main_~v~0) 4294967296) 268435455) (< (mod (+ c_main_~v~0 10) 4294967296) 268435455) (< (mod (+ 19 c_main_~v~0) 4294967296) 268435455) (< (mod (+ 40 c_main_~v~0) 4294967296) 268435455) (< (mod (+ 35 c_main_~v~0) 4294967296) 268435455) (< (mod (+ c_main_~v~0 25) 4294967296) 268435455) (< (mod (+ 42 c_main_~v~0) 4294967296) 268435455) (< (mod (+ c_main_~v~0 34) 4294967296) 268435455) (< (mod (+ c_main_~v~0 43) 4294967296) 268435455) (< (mod (+ c_main_~v~0 31) 4294967296) 268435455) (< (mod (+ 23 c_main_~v~0) 4294967296) 268435455) (< (mod (+ c_main_~v~0 1) 4294967296) 268435455) (< (mod (+ 14 c_main_~v~0) 4294967296) 268435455) (< (mod (+ c_main_~v~0 37) 4294967296) 268435455) (< (mod (+ c_main_~v~0 12) 4294967296) 268435455) (< (mod (+ c_main_~v~0 33) 4294967296) 268435455) (< (mod (+ 16 c_main_~v~0) 4294967296) 268435455) (< (mod (+ 2 c_main_~v~0) 4294967296) 268435455) (< (mod (+ c_main_~v~0 11) 4294967296) 268435455) (< (mod (+ c_main_~v~0 15) 4294967296) 268435455) (< (mod (+ 5 c_main_~v~0) 4294967296) 268435455) (< (mod (+ c_main_~v~0 8) 4294967296) 268435455) (< (mod (+ 41 c_main_~v~0) 4294967296) 268435455) (< (mod (+ c_main_~v~0 27) 4294967296) 268435455) (< (mod (+ 3 c_main_~v~0) 4294967296) 268435455) (< (mod (+ 21 c_main_~v~0) 4294967296) 268435455)) is different from false [2022-01-31 03:20:46,319 WARN L228 SmtUtils]: Spent 13.55s on a formula simplification. DAG size of input: 174 DAG size of output: 10 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-01-31 03:20:48,331 WARN L838 $PredicateComparison]: unable to prove that (and (= |c_#NULL.base| |c_old(#NULL.base)|) (< (mod (+ c_main_~v~0 39) 4294967296) 268435455) (< (mod (+ 7 c_main_~v~0) 4294967296) 268435455) (< (mod (+ c_main_~v~0 24) 4294967296) 268435455) (< (mod (+ c_main_~v~0 36) 4294967296) 268435455) (< (mod (+ c_main_~v~0 6) 4294967296) 268435455) (< (mod (+ c_main_~v~0 17) 4294967296) 268435455) (< (mod (+ c_main_~v~0 13) 4294967296) 268435455) (< (mod (+ c_main_~v~0 18) 4294967296) 268435455) (< (mod (+ 32 c_main_~v~0) 4294967296) 268435455) (< (mod (+ c_main_~v~0 28) 4294967296) 268435455) (< (mod (+ c_main_~v~0 20) 4294967296) 268435455) (< (mod (+ 29 c_main_~v~0) 4294967296) 268435455) (< (mod (+ 22 c_main_~v~0) 4294967296) 268435455) (< (mod c_main_~v~0 4294967296) 268435455) (< (mod (+ c_main_~v~0 38) 4294967296) 268435455) (< (mod (+ 9 c_main_~v~0) 4294967296) 268435455) (< (mod (+ c_main_~v~0 4) 4294967296) 268435455) (< (mod (+ c_main_~v~0 26) 4294967296) 268435455) (< (mod (+ 30 c_main_~v~0) 4294967296) 268435455) (< (mod (+ c_main_~v~0 10) 4294967296) 268435455) (< (mod (+ 19 c_main_~v~0) 4294967296) 268435455) (< (mod (+ 40 c_main_~v~0) 4294967296) 268435455) (< (mod (+ 35 c_main_~v~0) 4294967296) 268435455) (< (mod (+ c_main_~v~0 25) 4294967296) 268435455) (< (mod (+ 42 c_main_~v~0) 4294967296) 268435455) (< (mod (+ c_main_~v~0 34) 4294967296) 268435455) (< (mod (+ c_main_~v~0 31) 4294967296) 268435455) (< (mod (+ 23 c_main_~v~0) 4294967296) 268435455) (< (mod (+ c_main_~v~0 1) 4294967296) 268435455) (< (mod (+ 14 c_main_~v~0) 4294967296) 268435455) (< (mod (+ c_main_~v~0 37) 4294967296) 268435455) (< (mod (+ c_main_~v~0 12) 4294967296) 268435455) (< (mod (+ c_main_~v~0 33) 4294967296) 268435455) (< (mod (+ 16 c_main_~v~0) 4294967296) 268435455) (< (mod (+ 2 c_main_~v~0) 4294967296) 268435455) (< (mod (+ c_main_~v~0 11) 4294967296) 268435455) (< (mod (+ c_main_~v~0 15) 4294967296) 268435455) (< (mod (+ 5 c_main_~v~0) 4294967296) 268435455) (< (mod (+ c_main_~v~0 8) 4294967296) 268435455) (< (mod (+ 41 c_main_~v~0) 4294967296) 268435455) (< (mod (+ c_main_~v~0 27) 4294967296) 268435455) (= |c_#NULL.offset| |c_old(#NULL.offset)|) (< (mod (+ 3 c_main_~v~0) 4294967296) 268435455) (< (mod (+ 21 c_main_~v~0) 4294967296) 268435455)) is different from false [2022-01-31 03:20:50,341 WARN L838 $PredicateComparison]: unable to prove that (and (< (mod (+ c_main_~v~0 39) 4294967296) 268435455) (< (mod (+ 7 c_main_~v~0) 4294967296) 268435455) (< (mod (+ c_main_~v~0 24) 4294967296) 268435455) (< (mod (+ c_main_~v~0 36) 4294967296) 268435455) (< (mod (+ c_main_~v~0 6) 4294967296) 268435455) (< (mod (+ c_main_~v~0 17) 4294967296) 268435455) (< (mod (+ c_main_~v~0 13) 4294967296) 268435455) (< (mod (+ c_main_~v~0 18) 4294967296) 268435455) (< (mod (+ 32 c_main_~v~0) 4294967296) 268435455) (< (mod (+ c_main_~v~0 28) 4294967296) 268435455) (< (mod (+ c_main_~v~0 20) 4294967296) 268435455) (< (mod (+ 29 c_main_~v~0) 4294967296) 268435455) (< (mod (+ 22 c_main_~v~0) 4294967296) 268435455) (< (mod c_main_~v~0 4294967296) 268435455) (< (mod (+ c_main_~v~0 38) 4294967296) 268435455) (< (mod (+ 9 c_main_~v~0) 4294967296) 268435455) (< (mod (+ c_main_~v~0 4) 4294967296) 268435455) (< (mod (+ c_main_~v~0 26) 4294967296) 268435455) (< (mod (+ 30 c_main_~v~0) 4294967296) 268435455) (< (mod (+ c_main_~v~0 10) 4294967296) 268435455) (< (mod (+ 19 c_main_~v~0) 4294967296) 268435455) (< (mod (+ 40 c_main_~v~0) 4294967296) 268435455) (< (mod (+ 35 c_main_~v~0) 4294967296) 268435455) (< (mod (+ c_main_~v~0 25) 4294967296) 268435455) (< (mod (+ c_main_~v~0 34) 4294967296) 268435455) (< (mod (+ c_main_~v~0 31) 4294967296) 268435455) (< (mod (+ 23 c_main_~v~0) 4294967296) 268435455) (< (mod (+ c_main_~v~0 1) 4294967296) 268435455) (< (mod (+ 14 c_main_~v~0) 4294967296) 268435455) (< (mod (+ c_main_~v~0 37) 4294967296) 268435455) (< (mod (+ c_main_~v~0 12) 4294967296) 268435455) (< (mod (+ c_main_~v~0 33) 4294967296) 268435455) (< (mod (+ 16 c_main_~v~0) 4294967296) 268435455) (< (mod (+ 2 c_main_~v~0) 4294967296) 268435455) (< (mod (+ c_main_~v~0 11) 4294967296) 268435455) (< (mod (+ c_main_~v~0 15) 4294967296) 268435455) (< (mod (+ 5 c_main_~v~0) 4294967296) 268435455) (< (mod (+ c_main_~v~0 8) 4294967296) 268435455) (< (mod (+ 41 c_main_~v~0) 4294967296) 268435455) (< (mod (+ c_main_~v~0 27) 4294967296) 268435455) (< (mod (+ 3 c_main_~v~0) 4294967296) 268435455) (< (mod (+ 21 c_main_~v~0) 4294967296) 268435455)) is different from false [2022-01-31 03:21:51,152 WARN L228 SmtUtils]: Spent 10.06s on a formula simplification. DAG size of input: 168 DAG size of output: 12 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-01-31 03:22:46,036 WARN L228 SmtUtils]: Spent 6.86s on a formula simplification. DAG size of input: 172 DAG size of output: 16 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-01-31 03:23:56,599 WARN L228 SmtUtils]: Spent 10.06s on a formula simplification. DAG size of input: 168 DAG size of output: 16 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-01-31 03:24:54,354 WARN L228 SmtUtils]: Spent 10.63s on a formula simplification. DAG size of input: 164 DAG size of output: 16 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-01-31 03:25:50,522 WARN L228 SmtUtils]: Spent 6.07s on a formula simplification. DAG size of input: 160 DAG size of output: 16 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-01-31 03:26:54,980 WARN L228 SmtUtils]: Spent 11.36s on a formula simplification. DAG size of input: 156 DAG size of output: 16 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate)