./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount100_file-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a046e57d Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount100_file-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash d49e82c63c2bb2c50317e322b05c62ce756ce2b0f76f53e25c5542bb842ee0fc --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-13 04:47:42,787 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 04:47:42,858 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-13 04:47:42,863 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 04:47:42,864 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 04:47:42,891 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 04:47:42,892 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 04:47:42,892 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 04:47:42,893 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-13 04:47:42,894 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-13 04:47:42,895 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-13 04:47:42,895 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-13 04:47:42,896 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 04:47:42,896 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 04:47:42,897 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 04:47:42,900 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 04:47:42,900 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-13 04:47:42,900 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-13 04:47:42,901 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-13 04:47:42,901 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-13 04:47:42,901 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 04:47:42,902 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-13 04:47:42,902 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-13 04:47:42,902 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-13 04:47:42,902 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 04:47:42,903 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-13 04:47:42,903 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-13 04:47:42,903 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 04:47:42,903 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 04:47:42,904 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 04:47:42,904 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-13 04:47:42,904 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-13 04:47:42,904 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 04:47:42,904 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 04:47:42,905 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-13 04:47:42,905 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-13 04:47:42,907 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-13 04:47:42,907 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-13 04:47:42,907 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-13 04:47:42,908 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-13 04:47:42,908 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-13 04:47:42,908 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-13 04:47:42,908 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> d49e82c63c2bb2c50317e322b05c62ce756ce2b0f76f53e25c5542bb842ee0fc [2024-10-13 04:47:43,221 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 04:47:43,243 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 04:47:43,247 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 04:47:43,248 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 04:47:43,249 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 04:47:43,250 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount100_file-1.i [2024-10-13 04:47:44,718 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 04:47:44,944 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 04:47:44,945 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount100_file-1.i [2024-10-13 04:47:44,963 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/103c22025/9d9dcd470fcf4a4194238730c7a333b6/FLAGf584008b4 [2024-10-13 04:47:44,978 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/103c22025/9d9dcd470fcf4a4194238730c7a333b6 [2024-10-13 04:47:44,981 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 04:47:44,982 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 04:47:44,984 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 04:47:44,987 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 04:47:44,992 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 04:47:44,993 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 04:47:44" (1/1) ... [2024-10-13 04:47:44,994 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@74892dfb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:47:44, skipping insertion in model container [2024-10-13 04:47:44,994 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 04:47:44" (1/1) ... [2024-10-13 04:47:45,034 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 04:47:45,212 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount100_file-1.i[915,928] [2024-10-13 04:47:45,293 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 04:47:45,308 INFO L200 MainTranslator]: Completed pre-run [2024-10-13 04:47:45,319 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount100_file-1.i[915,928] [2024-10-13 04:47:45,382 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 04:47:45,406 INFO L204 MainTranslator]: Completed translation [2024-10-13 04:47:45,406 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:47:45 WrapperNode [2024-10-13 04:47:45,407 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 04:47:45,408 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-13 04:47:45,408 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-13 04:47:45,408 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-13 04:47:45,416 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:47:45" (1/1) ... [2024-10-13 04:47:45,433 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:47:45" (1/1) ... [2024-10-13 04:47:45,475 INFO L138 Inliner]: procedures = 26, calls = 46, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 260 [2024-10-13 04:47:45,476 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-13 04:47:45,477 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-13 04:47:45,477 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-13 04:47:45,477 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-13 04:47:45,493 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:47:45" (1/1) ... [2024-10-13 04:47:45,494 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:47:45" (1/1) ... [2024-10-13 04:47:45,502 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:47:45" (1/1) ... [2024-10-13 04:47:45,526 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-13 04:47:45,527 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:47:45" (1/1) ... [2024-10-13 04:47:45,527 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:47:45" (1/1) ... [2024-10-13 04:47:45,547 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:47:45" (1/1) ... [2024-10-13 04:47:45,555 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:47:45" (1/1) ... [2024-10-13 04:47:45,567 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:47:45" (1/1) ... [2024-10-13 04:47:45,571 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:47:45" (1/1) ... [2024-10-13 04:47:45,583 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-13 04:47:45,585 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-13 04:47:45,586 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-13 04:47:45,586 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-13 04:47:45,587 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:47:45" (1/1) ... [2024-10-13 04:47:45,592 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 04:47:45,602 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 04:47:45,620 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-13 04:47:45,627 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-13 04:47:45,714 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-13 04:47:45,715 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-13 04:47:45,716 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-13 04:47:45,716 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-13 04:47:45,716 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-13 04:47:45,716 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-13 04:47:45,848 INFO L238 CfgBuilder]: Building ICFG [2024-10-13 04:47:45,850 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-13 04:47:46,469 INFO L? ?]: Removed 33 outVars from TransFormulas that were not future-live. [2024-10-13 04:47:46,470 INFO L287 CfgBuilder]: Performing block encoding [2024-10-13 04:47:46,530 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-13 04:47:46,531 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-13 04:47:46,531 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 04:47:46 BoogieIcfgContainer [2024-10-13 04:47:46,531 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-13 04:47:46,534 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-13 04:47:46,534 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-13 04:47:46,538 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-13 04:47:46,539 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 04:47:44" (1/3) ... [2024-10-13 04:47:46,540 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@49b65f07 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 04:47:46, skipping insertion in model container [2024-10-13 04:47:46,540 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:47:45" (2/3) ... [2024-10-13 04:47:46,541 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@49b65f07 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 04:47:46, skipping insertion in model container [2024-10-13 04:47:46,541 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 04:47:46" (3/3) ... [2024-10-13 04:47:46,542 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount100_file-1.i [2024-10-13 04:47:46,559 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-13 04:47:46,559 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-13 04:47:46,620 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-13 04:47:46,627 INFO L333 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, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, 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, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@20a22ac9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-13 04:47:46,627 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-13 04:47:46,633 INFO L276 IsEmpty]: Start isEmpty. Operand has 110 states, 74 states have (on average 1.5) internal successors, (111), 75 states have internal predecessors, (111), 33 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) [2024-10-13 04:47:46,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2024-10-13 04:47:46,652 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 04:47:46,653 INFO L215 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 04:47:46,654 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 04:47:46,658 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 04:47:46,659 INFO L85 PathProgramCache]: Analyzing trace with hash 73095227, now seen corresponding path program 1 times [2024-10-13 04:47:46,668 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 04:47:46,668 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [794472239] [2024-10-13 04:47:46,669 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 04:47:46,669 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 04:47:46,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:47:47,554 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 04:47:47,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:47:47,565 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 04:47:47,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:47:47,578 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 04:47:47,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:47:47,587 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 04:47:47,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:47:47,599 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 04:47:47,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:47:47,611 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 04:47:47,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:47:47,618 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 04:47:47,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:47:47,631 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-13 04:47:47,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:47:47,640 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-13 04:47:47,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:47:47,647 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-13 04:47:47,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:47:47,656 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-13 04:47:47,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:47:47,665 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-13 04:47:47,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:47:47,679 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-13 04:47:47,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:47:47,689 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-13 04:47:47,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:47:47,693 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-13 04:47:47,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:47:47,700 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-10-13 04:47:47,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:47:47,707 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-13 04:47:47,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:47:47,712 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-13 04:47:47,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:47:47,719 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-10-13 04:47:47,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:47:47,728 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-10-13 04:47:47,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:47:47,736 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-10-13 04:47:47,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:47:47,748 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-10-13 04:47:47,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:47:47,759 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-13 04:47:47,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:47:47,768 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-10-13 04:47:47,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:47:47,776 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-10-13 04:47:47,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:47:47,784 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-10-13 04:47:47,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:47:47,793 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-10-13 04:47:47,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:47:47,802 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2024-10-13 04:47:47,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:47:47,816 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-10-13 04:47:47,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:47:47,823 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2024-10-13 04:47:47,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:47:47,832 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2024-10-13 04:47:47,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:47:47,845 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2024-10-13 04:47:47,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:47:47,855 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 181 [2024-10-13 04:47:47,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:47:47,866 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked. [2024-10-13 04:47:47,869 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 04:47:47,869 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [794472239] [2024-10-13 04:47:47,871 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [794472239] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 04:47:47,871 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 04:47:47,871 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 04:47:47,873 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1504672003] [2024-10-13 04:47:47,875 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 04:47:47,880 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 04:47:47,881 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 04:47:47,909 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 04:47:47,910 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 04:47:47,913 INFO L87 Difference]: Start difference. First operand has 110 states, 74 states have (on average 1.5) internal successors, (111), 75 states have internal predecessors, (111), 33 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) Second operand has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2024-10-13 04:47:48,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 04:47:48,067 INFO L93 Difference]: Finished difference Result 324 states and 593 transitions. [2024-10-13 04:47:48,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 04:47:48,070 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) Word has length 209 [2024-10-13 04:47:48,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 04:47:48,085 INFO L225 Difference]: With dead ends: 324 [2024-10-13 04:47:48,086 INFO L226 Difference]: Without dead ends: 215 [2024-10-13 04:47:48,092 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-13 04:47:48,099 INFO L432 NwaCegarLoop]: 167 mSDtfsCounter, 104 mSDsluCounter, 330 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 497 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 04:47:48,101 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [104 Valid, 497 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 04:47:48,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2024-10-13 04:47:48,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 213. [2024-10-13 04:47:48,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 213 states, 144 states have (on average 1.4513888888888888) internal successors, (209), 144 states have internal predecessors, (209), 66 states have call successors, (66), 2 states have call predecessors, (66), 2 states have return successors, (66), 66 states have call predecessors, (66), 66 states have call successors, (66) [2024-10-13 04:47:48,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 341 transitions. [2024-10-13 04:47:48,242 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 341 transitions. Word has length 209 [2024-10-13 04:47:48,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 04:47:48,244 INFO L471 AbstractCegarLoop]: Abstraction has 213 states and 341 transitions. [2024-10-13 04:47:48,244 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2024-10-13 04:47:48,244 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 341 transitions. [2024-10-13 04:47:48,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2024-10-13 04:47:48,252 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 04:47:48,253 INFO L215 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 04:47:48,253 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-13 04:47:48,253 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 04:47:48,254 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 04:47:48,254 INFO L85 PathProgramCache]: Analyzing trace with hash 406007518, now seen corresponding path program 1 times [2024-10-13 04:47:48,254 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 04:47:48,255 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [916474818] [2024-10-13 04:47:48,255 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 04:47:48,256 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 04:47:48,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:47:49,314 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 04:47:49,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:47:49,322 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 04:47:49,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:47:49,327 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 04:47:49,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:47:49,330 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 04:47:49,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:47:49,333 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 04:47:49,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:47:49,336 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 04:47:49,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:47:49,339 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 04:47:49,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:47:49,341 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-13 04:47:49,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:47:49,344 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-13 04:47:49,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:47:49,347 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-13 04:47:49,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:47:49,353 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-13 04:47:49,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:47:49,358 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-13 04:47:49,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:47:49,361 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-13 04:47:49,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:47:49,369 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-13 04:47:49,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:47:49,372 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-13 04:47:49,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:47:49,375 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-10-13 04:47:49,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:47:49,382 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-13 04:47:49,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:47:49,385 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-13 04:47:49,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:47:49,389 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-10-13 04:47:49,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:47:49,393 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-10-13 04:47:49,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:47:49,396 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-10-13 04:47:49,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:47:49,400 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-10-13 04:47:49,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:47:49,405 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-13 04:47:49,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:47:49,409 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-10-13 04:47:49,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:47:49,413 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-10-13 04:47:49,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:47:49,417 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-10-13 04:47:49,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:47:49,421 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-10-13 04:47:49,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:47:49,424 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2024-10-13 04:47:49,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:47:49,427 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-10-13 04:47:49,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:47:49,430 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2024-10-13 04:47:49,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:47:49,436 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2024-10-13 04:47:49,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:47:49,442 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2024-10-13 04:47:49,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:47:49,445 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 181 [2024-10-13 04:47:49,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:47:49,449 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked. [2024-10-13 04:47:49,450 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 04:47:49,450 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [916474818] [2024-10-13 04:47:49,451 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [916474818] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 04:47:49,451 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 04:47:49,451 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 04:47:49,452 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2087421953] [2024-10-13 04:47:49,453 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 04:47:49,454 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 04:47:49,455 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 04:47:49,457 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 04:47:49,458 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 04:47:49,458 INFO L87 Difference]: Start difference. First operand 213 states and 341 transitions. Second operand has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2024-10-13 04:47:49,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 04:47:49,810 INFO L93 Difference]: Finished difference Result 533 states and 846 transitions. [2024-10-13 04:47:49,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 04:47:49,811 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) Word has length 210 [2024-10-13 04:47:49,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 04:47:49,817 INFO L225 Difference]: With dead ends: 533 [2024-10-13 04:47:49,819 INFO L226 Difference]: Without dead ends: 321 [2024-10-13 04:47:49,821 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-13 04:47:49,824 INFO L432 NwaCegarLoop]: 182 mSDtfsCounter, 81 mSDsluCounter, 281 mSDsCounter, 0 mSdLazyCounter, 121 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 463 SdHoareTripleChecker+Invalid, 121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 121 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-13 04:47:49,825 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 463 Invalid, 121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 121 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-13 04:47:49,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 321 states. [2024-10-13 04:47:49,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 321 to 317. [2024-10-13 04:47:49,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 317 states, 224 states have (on average 1.4508928571428572) internal successors, (325), 226 states have internal predecessors, (325), 88 states have call successors, (88), 4 states have call predecessors, (88), 4 states have return successors, (88), 86 states have call predecessors, (88), 88 states have call successors, (88) [2024-10-13 04:47:49,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 317 states to 317 states and 501 transitions. [2024-10-13 04:47:49,899 INFO L78 Accepts]: Start accepts. Automaton has 317 states and 501 transitions. Word has length 210 [2024-10-13 04:47:49,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 04:47:49,900 INFO L471 AbstractCegarLoop]: Abstraction has 317 states and 501 transitions. [2024-10-13 04:47:49,900 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2024-10-13 04:47:49,900 INFO L276 IsEmpty]: Start isEmpty. Operand 317 states and 501 transitions. [2024-10-13 04:47:49,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2024-10-13 04:47:49,907 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 04:47:49,908 INFO L215 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 04:47:49,908 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-13 04:47:49,908 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 04:47:49,909 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 04:47:49,909 INFO L85 PathProgramCache]: Analyzing trace with hash -274050852, now seen corresponding path program 1 times [2024-10-13 04:47:49,909 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 04:47:49,909 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [665281558] [2024-10-13 04:47:49,909 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 04:47:49,911 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 04:47:50,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:47:57,715 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 04:47:57,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:47:57,721 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 04:47:57,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:47:57,852 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 04:47:57,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:47:57,857 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 04:47:57,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:47:57,861 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 04:47:57,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:47:57,865 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 04:47:57,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:47:57,869 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 04:47:57,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:47:57,874 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-13 04:47:57,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:47:57,883 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-13 04:47:57,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:47:57,890 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-13 04:47:57,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:47:57,897 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-13 04:47:57,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:47:57,901 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-13 04:47:57,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:47:57,922 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-13 04:47:57,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:47:57,931 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-13 04:47:57,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:47:57,937 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-13 04:47:57,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:47:57,959 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-10-13 04:47:57,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:47:57,966 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-13 04:47:57,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:47:57,985 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-13 04:47:57,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:47:57,994 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-10-13 04:47:57,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:47:58,004 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-10-13 04:47:58,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:47:58,012 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-10-13 04:47:58,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:47:58,019 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-10-13 04:47:58,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:47:58,043 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-13 04:47:58,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:47:58,059 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-10-13 04:47:58,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:47:58,074 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-10-13 04:47:58,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:47:58,083 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-10-13 04:47:58,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:47:58,110 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-10-13 04:47:58,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:47:58,120 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2024-10-13 04:47:58,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:47:58,159 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-10-13 04:47:58,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:47:58,198 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2024-10-13 04:47:58,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:47:58,223 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2024-10-13 04:47:58,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:47:58,247 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2024-10-13 04:47:58,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:47:58,295 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 181 [2024-10-13 04:47:58,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:47:58,321 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 345 proven. 255 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2024-10-13 04:47:58,322 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 04:47:58,322 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [665281558] [2024-10-13 04:47:58,322 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [665281558] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 04:47:58,322 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1151327958] [2024-10-13 04:47:58,323 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 04:47:58,323 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 04:47:58,323 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 04:47:58,325 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) [2024-10-13 04:47:58,327 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-13 04:47:58,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:47:58,538 INFO L255 TraceCheckSpWp]: Trace formula consists of 465 conjuncts, 39 conjuncts are in the unsatisfiable core [2024-10-13 04:47:58,551 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 04:48:07,413 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 1555 proven. 246 refuted. 0 times theorem prover too weak. 311 trivial. 0 not checked. [2024-10-13 04:48:07,414 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 04:48:13,374 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1151327958] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 04:48:13,374 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-13 04:48:13,374 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 22] total 38 [2024-10-13 04:48:13,375 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1619838319] [2024-10-13 04:48:13,375 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-13 04:48:13,376 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2024-10-13 04:48:13,376 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 04:48:13,377 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2024-10-13 04:48:13,381 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=203, Invalid=1686, Unknown=3, NotChecked=0, Total=1892 [2024-10-13 04:48:13,381 INFO L87 Difference]: Start difference. First operand 317 states and 501 transitions. Second operand has 38 states, 36 states have (on average 3.3055555555555554) internal successors, (119), 37 states have internal predecessors, (119), 16 states have call successors, (66), 7 states have call predecessors, (66), 13 states have return successors, (66), 16 states have call predecessors, (66), 16 states have call successors, (66) [2024-10-13 04:48:39,597 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2024-10-13 04:48:43,770 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2024-10-13 04:48:52,379 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2024-10-13 04:48:56,524 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2024-10-13 04:49:00,756 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2024-10-13 04:49:04,844 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2024-10-13 04:49:11,325 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0]