./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-98.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-98.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/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 fa899b25f522973b6bbc58879b0eb17248367bb8b552686dbd6511ffcd7729d0 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 10:34:28,392 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 10:34:28,456 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-09 10:34:28,463 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 10:34:28,465 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 10:34:28,487 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 10:34:28,488 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 10:34:28,489 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 10:34:28,489 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 10:34:28,489 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 10:34:28,490 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 10:34:28,490 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 10:34:28,490 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 10:34:28,490 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 10:34:28,491 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 10:34:28,491 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 10:34:28,491 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 10:34:28,491 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 10:34:28,491 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 10:34:28,491 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 10:34:28,492 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 10:34:28,492 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 10:34:28,492 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 10:34:28,492 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 10:34:28,492 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 10:34:28,492 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 10:34:28,492 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 10:34:28,492 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 10:34:28,492 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 10:34:28,492 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 10:34:28,493 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 10:34:28,493 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 10:34:28,493 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 10:34:28,493 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 10:34:28,493 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 10:34:28,493 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 10:34:28,493 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 10:34:28,493 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 10:34:28,493 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 10:34:28,493 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 10:34:28,493 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 10:34:28,493 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 10:34:28,493 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 10:34:28,493 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 10:34:28,494 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 10:34:28,494 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 10:34:28,494 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 10:34:28,494 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 10:34:28,494 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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-jdk21/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 -> fa899b25f522973b6bbc58879b0eb17248367bb8b552686dbd6511ffcd7729d0 [2025-01-09 10:34:28,760 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 10:34:28,772 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 10:34:28,773 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 10:34:28,775 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 10:34:28,776 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 10:34:28,777 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-98.i [2025-01-09 10:34:29,954 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/26f9e2534/74e4d2596561472988b69a1ea79180d0/FLAGe14afcb6a [2025-01-09 10:34:30,272 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 10:34:30,273 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-98.i [2025-01-09 10:34:30,279 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/26f9e2534/74e4d2596561472988b69a1ea79180d0/FLAGe14afcb6a [2025-01-09 10:34:30,546 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/26f9e2534/74e4d2596561472988b69a1ea79180d0 [2025-01-09 10:34:30,548 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 10:34:30,549 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 10:34:30,550 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 10:34:30,550 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 10:34:30,553 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 10:34:30,554 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 10:34:30" (1/1) ... [2025-01-09 10:34:30,554 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@beba044 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:34:30, skipping insertion in model container [2025-01-09 10:34:30,555 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 10:34:30" (1/1) ... [2025-01-09 10:34:30,572 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 10:34:30,678 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-98.i[919,932] [2025-01-09 10:34:30,757 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 10:34:30,772 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 10:34:30,781 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-98.i[919,932] [2025-01-09 10:34:30,809 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 10:34:30,825 INFO L204 MainTranslator]: Completed translation [2025-01-09 10:34:30,826 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:34:30 WrapperNode [2025-01-09 10:34:30,828 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 10:34:30,829 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 10:34:30,829 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 10:34:30,829 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 10:34:30,835 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:34:30" (1/1) ... [2025-01-09 10:34:30,850 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:34:30" (1/1) ... [2025-01-09 10:34:30,888 INFO L138 Inliner]: procedures = 26, calls = 46, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 240 [2025-01-09 10:34:30,888 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 10:34:30,891 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 10:34:30,892 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 10:34:30,892 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 10:34:30,898 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:34:30" (1/1) ... [2025-01-09 10:34:30,898 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:34:30" (1/1) ... [2025-01-09 10:34:30,905 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:34:30" (1/1) ... [2025-01-09 10:34:30,926 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]. [2025-01-09 10:34:30,926 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:34:30" (1/1) ... [2025-01-09 10:34:30,926 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:34:30" (1/1) ... [2025-01-09 10:34:30,935 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:34:30" (1/1) ... [2025-01-09 10:34:30,940 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:34:30" (1/1) ... [2025-01-09 10:34:30,945 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:34:30" (1/1) ... [2025-01-09 10:34:30,947 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:34:30" (1/1) ... [2025-01-09 10:34:30,951 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:34:30" (1/1) ... [2025-01-09 10:34:30,954 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 10:34:30,957 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 10:34:30,957 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 10:34:30,957 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 10:34:30,958 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:34:30" (1/1) ... [2025-01-09 10:34:30,962 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 10:34:30,973 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 10:34:30,986 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-09 10:34:30,994 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-09 10:34:31,010 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 10:34:31,010 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 10:34:31,010 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 10:34:31,010 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 10:34:31,010 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 10:34:31,010 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 10:34:31,084 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 10:34:31,086 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 10:34:31,490 INFO L? ?]: Removed 16 outVars from TransFormulas that were not future-live. [2025-01-09 10:34:31,490 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 10:34:31,498 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 10:34:31,498 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 10:34:31,499 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 10:34:31 BoogieIcfgContainer [2025-01-09 10:34:31,499 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 10:34:31,500 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 10:34:31,500 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 10:34:31,504 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 10:34:31,504 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 10:34:30" (1/3) ... [2025-01-09 10:34:31,505 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@49b83b50 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 10:34:31, skipping insertion in model container [2025-01-09 10:34:31,505 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:34:30" (2/3) ... [2025-01-09 10:34:31,506 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@49b83b50 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 10:34:31, skipping insertion in model container [2025-01-09 10:34:31,506 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 10:34:31" (3/3) ... [2025-01-09 10:34:31,507 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pe-ci_file-98.i [2025-01-09 10:34:31,518 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 10:34:31,519 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodestructure_filler-pe-ci_file-98.i that has 2 procedures, 103 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 10:34:31,562 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 10:34:31,570 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;@4c435895, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 10:34:31,570 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 10:34:31,573 INFO L276 IsEmpty]: Start isEmpty. Operand has 103 states, 67 states have (on average 1.4328358208955223) internal successors, (96), 68 states have internal predecessors, (96), 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) [2025-01-09 10:34:31,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2025-01-09 10:34:31,582 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:34:31,582 INFO L218 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, 1] [2025-01-09 10:34:31,583 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:34:31,586 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:34:31,586 INFO L85 PathProgramCache]: Analyzing trace with hash -626594604, now seen corresponding path program 1 times [2025-01-09 10:34:31,591 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:34:31,592 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1535815282] [2025-01-09 10:34:31,592 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:34:31,592 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:34:31,698 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 211 statements into 1 equivalence classes. [2025-01-09 10:34:31,889 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 211 of 211 statements. [2025-01-09 10:34:31,890 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:34:31,890 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:34:33,349 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked. [2025-01-09 10:34:33,350 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:34:33,350 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1535815282] [2025-01-09 10:34:33,350 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1535815282] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:34:33,351 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 10:34:33,351 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 10:34:33,352 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [203440106] [2025-01-09 10:34:33,352 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:34:33,356 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 10:34:33,356 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:34:33,371 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 10:34:33,372 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 10:34:33,375 INFO L87 Difference]: Start difference. First operand has 103 states, 67 states have (on average 1.4328358208955223) internal successors, (96), 68 states have internal predecessors, (96), 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 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 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) [2025-01-09 10:34:33,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:34:33,577 INFO L93 Difference]: Finished difference Result 222 states and 390 transitions. [2025-01-09 10:34:33,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 10:34:33,579 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 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 211 [2025-01-09 10:34:33,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:34:33,590 INFO L225 Difference]: With dead ends: 222 [2025-01-09 10:34:33,590 INFO L226 Difference]: Without dead ends: 122 [2025-01-09 10:34:33,593 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 10:34:33,595 INFO L435 NwaCegarLoop]: 159 mSDtfsCounter, 43 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 266 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 10:34:33,596 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 266 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 10:34:33,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2025-01-09 10:34:33,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 116. [2025-01-09 10:34:33,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 81 states have (on average 1.4197530864197532) internal successors, (115), 81 states have internal predecessors, (115), 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) [2025-01-09 10:34:33,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 181 transitions. [2025-01-09 10:34:33,648 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 181 transitions. Word has length 211 [2025-01-09 10:34:33,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:34:33,650 INFO L471 AbstractCegarLoop]: Abstraction has 116 states and 181 transitions. [2025-01-09 10:34:33,650 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 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) [2025-01-09 10:34:33,650 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 181 transitions. [2025-01-09 10:34:33,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2025-01-09 10:34:33,654 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:34:33,654 INFO L218 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, 1] [2025-01-09 10:34:33,654 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 10:34:33,655 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:34:33,655 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:34:33,655 INFO L85 PathProgramCache]: Analyzing trace with hash 1979428950, now seen corresponding path program 1 times [2025-01-09 10:34:33,656 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:34:33,656 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [781713295] [2025-01-09 10:34:33,656 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:34:33,656 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:34:33,682 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 211 statements into 1 equivalence classes. [2025-01-09 10:34:33,753 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 211 of 211 statements. [2025-01-09 10:34:33,757 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:34:33,758 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:34:34,149 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked. [2025-01-09 10:34:34,149 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:34:34,149 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [781713295] [2025-01-09 10:34:34,149 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [781713295] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:34:34,149 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 10:34:34,149 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 10:34:34,149 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1849143375] [2025-01-09 10:34:34,149 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:34:34,150 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 10:34:34,151 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:34:34,151 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 10:34:34,151 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 10:34:34,152 INFO L87 Difference]: Start difference. First operand 116 states and 181 transitions. Second operand has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 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) [2025-01-09 10:34:34,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:34:34,274 INFO L93 Difference]: Finished difference Result 231 states and 363 transitions. [2025-01-09 10:34:34,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 10:34:34,275 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 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 211 [2025-01-09 10:34:34,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:34:34,277 INFO L225 Difference]: With dead ends: 231 [2025-01-09 10:34:34,277 INFO L226 Difference]: Without dead ends: 118 [2025-01-09 10:34:34,278 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 10:34:34,278 INFO L435 NwaCegarLoop]: 122 mSDtfsCounter, 147 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 147 SdHoareTripleChecker+Valid, 233 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 10:34:34,279 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [147 Valid, 233 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 10:34:34,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2025-01-09 10:34:34,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 109. [2025-01-09 10:34:34,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 74 states have (on average 1.3783783783783783) internal successors, (102), 74 states have internal predecessors, (102), 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) [2025-01-09 10:34:34,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 168 transitions. [2025-01-09 10:34:34,289 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 168 transitions. Word has length 211 [2025-01-09 10:34:34,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:34:34,290 INFO L471 AbstractCegarLoop]: Abstraction has 109 states and 168 transitions. [2025-01-09 10:34:34,290 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 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) [2025-01-09 10:34:34,290 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 168 transitions. [2025-01-09 10:34:34,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2025-01-09 10:34:34,292 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:34:34,292 INFO L218 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, 1, 1] [2025-01-09 10:34:34,292 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 10:34:34,292 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:34:34,293 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:34:34,293 INFO L85 PathProgramCache]: Analyzing trace with hash -1139711948, now seen corresponding path program 1 times [2025-01-09 10:34:34,293 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:34:34,293 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [847539481] [2025-01-09 10:34:34,293 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:34:34,293 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:34:34,322 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 212 statements into 1 equivalence classes. [2025-01-09 10:34:34,382 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 212 of 212 statements. [2025-01-09 10:34:34,383 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:34:34,383 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:34:35,112 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked. [2025-01-09 10:34:35,113 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:34:35,113 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [847539481] [2025-01-09 10:34:35,113 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [847539481] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:34:35,113 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 10:34:35,113 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-01-09 10:34:35,113 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1793568125] [2025-01-09 10:34:35,113 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:34:35,114 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 10:34:35,114 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:34:35,114 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 10:34:35,114 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2025-01-09 10:34:35,115 INFO L87 Difference]: Start difference. First operand 109 states and 168 transitions. Second operand has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 9 states have internal predecessors, (50), 3 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 3 states have call predecessors, (33), 3 states have call successors, (33) [2025-01-09 10:34:35,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:34:35,952 INFO L93 Difference]: Finished difference Result 311 states and 483 transitions. [2025-01-09 10:34:35,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 10:34:35,953 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 9 states have internal predecessors, (50), 3 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 3 states have call predecessors, (33), 3 states have call successors, (33) Word has length 212 [2025-01-09 10:34:35,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:34:35,957 INFO L225 Difference]: With dead ends: 311 [2025-01-09 10:34:35,960 INFO L226 Difference]: Without dead ends: 205 [2025-01-09 10:34:35,961 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=86, Invalid=154, Unknown=0, NotChecked=0, Total=240 [2025-01-09 10:34:35,962 INFO L435 NwaCegarLoop]: 115 mSDtfsCounter, 575 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 271 mSolverCounterSat, 491 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 575 SdHoareTripleChecker+Valid, 216 SdHoareTripleChecker+Invalid, 762 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 491 IncrementalHoareTripleChecker+Valid, 271 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-09 10:34:35,962 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [575 Valid, 216 Invalid, 762 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [491 Valid, 271 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-09 10:34:35,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2025-01-09 10:34:36,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 200. [2025-01-09 10:34:36,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 200 states, 131 states have (on average 1.3587786259541985) internal successors, (178), 131 states have internal predecessors, (178), 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) [2025-01-09 10:34:36,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 310 transitions. [2025-01-09 10:34:36,012 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 310 transitions. Word has length 212 [2025-01-09 10:34:36,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:34:36,013 INFO L471 AbstractCegarLoop]: Abstraction has 200 states and 310 transitions. [2025-01-09 10:34:36,013 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 9 states have internal predecessors, (50), 3 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 3 states have call predecessors, (33), 3 states have call successors, (33) [2025-01-09 10:34:36,013 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 310 transitions. [2025-01-09 10:34:36,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2025-01-09 10:34:36,015 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:34:36,016 INFO L218 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, 1, 1] [2025-01-09 10:34:36,016 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 10:34:36,016 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:34:36,016 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:34:36,016 INFO L85 PathProgramCache]: Analyzing trace with hash 290240008, now seen corresponding path program 1 times [2025-01-09 10:34:36,017 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:34:36,017 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1297792451] [2025-01-09 10:34:36,017 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:34:36,017 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:34:36,034 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 212 statements into 1 equivalence classes. [2025-01-09 10:34:36,068 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 212 of 212 statements. [2025-01-09 10:34:36,068 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:34:36,068 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:34:36,536 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked. [2025-01-09 10:34:36,537 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:34:36,537 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1297792451] [2025-01-09 10:34:36,537 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1297792451] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:34:36,537 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 10:34:36,537 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 10:34:36,537 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [956177765] [2025-01-09 10:34:36,537 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:34:36,538 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 10:34:36,538 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:34:36,539 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 10:34:36,539 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 10:34:36,539 INFO L87 Difference]: Start difference. First operand 200 states and 310 transitions. Second operand has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 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) [2025-01-09 10:34:36,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:34:36,627 INFO L93 Difference]: Finished difference Result 457 states and 710 transitions. [2025-01-09 10:34:36,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 10:34:36,628 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 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 212 [2025-01-09 10:34:36,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:34:36,630 INFO L225 Difference]: With dead ends: 457 [2025-01-09 10:34:36,631 INFO L226 Difference]: Without dead ends: 260 [2025-01-09 10:34:36,631 INFO L434 NwaCegarLoop]: 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 [2025-01-09 10:34:36,633 INFO L435 NwaCegarLoop]: 207 mSDtfsCounter, 139 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 139 SdHoareTripleChecker+Valid, 299 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 10:34:36,634 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [139 Valid, 299 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 10:34:36,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 260 states. [2025-01-09 10:34:36,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 260 to 192. [2025-01-09 10:34:36,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 192 states, 123 states have (on average 1.3414634146341464) internal successors, (165), 123 states have internal predecessors, (165), 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) [2025-01-09 10:34:36,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 297 transitions. [2025-01-09 10:34:36,675 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 297 transitions. Word has length 212 [2025-01-09 10:34:36,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:34:36,676 INFO L471 AbstractCegarLoop]: Abstraction has 192 states and 297 transitions. [2025-01-09 10:34:36,676 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 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) [2025-01-09 10:34:36,676 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 297 transitions. [2025-01-09 10:34:36,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2025-01-09 10:34:36,679 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:34:36,679 INFO L218 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, 1, 1] [2025-01-09 10:34:36,680 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 10:34:36,680 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:34:36,680 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:34:36,680 INFO L85 PathProgramCache]: Analyzing trace with hash -828030930, now seen corresponding path program 1 times [2025-01-09 10:34:36,681 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:34:36,681 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1470565780] [2025-01-09 10:34:36,681 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:34:36,681 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:34:36,695 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 212 statements into 1 equivalence classes. [2025-01-09 10:34:36,735 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 212 of 212 statements. [2025-01-09 10:34:36,735 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:34:36,735 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:34:37,360 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked. [2025-01-09 10:34:37,361 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:34:37,361 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1470565780] [2025-01-09 10:34:37,362 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1470565780] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:34:37,362 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 10:34:37,362 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 10:34:37,362 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1528414630] [2025-01-09 10:34:37,362 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:34:37,362 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 10:34:37,363 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:34:37,364 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 10:34:37,364 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-09 10:34:37,364 INFO L87 Difference]: Start difference. First operand 192 states and 297 transitions. Second operand has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 states have internal predecessors, (50), 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) [2025-01-09 10:34:38,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:34:38,119 INFO L93 Difference]: Finished difference Result 632 states and 979 transitions. [2025-01-09 10:34:38,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 10:34:38,120 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 states have internal predecessors, (50), 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 212 [2025-01-09 10:34:38,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:34:38,124 INFO L225 Difference]: With dead ends: 632 [2025-01-09 10:34:38,124 INFO L226 Difference]: Without dead ends: 443 [2025-01-09 10:34:38,125 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-01-09 10:34:38,126 INFO L435 NwaCegarLoop]: 157 mSDtfsCounter, 312 mSDsluCounter, 379 mSDsCounter, 0 mSdLazyCounter, 257 mSolverCounterSat, 332 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 312 SdHoareTripleChecker+Valid, 536 SdHoareTripleChecker+Invalid, 589 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 332 IncrementalHoareTripleChecker+Valid, 257 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-09 10:34:38,126 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [312 Valid, 536 Invalid, 589 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [332 Valid, 257 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-09 10:34:38,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 443 states. [2025-01-09 10:34:38,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 443 to 376. [2025-01-09 10:34:38,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 376 states, 239 states have (on average 1.3389121338912133) internal successors, (320), 239 states have internal predecessors, (320), 132 states have call successors, (132), 4 states have call predecessors, (132), 4 states have return successors, (132), 132 states have call predecessors, (132), 132 states have call successors, (132) [2025-01-09 10:34:38,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 376 states to 376 states and 584 transitions. [2025-01-09 10:34:38,199 INFO L78 Accepts]: Start accepts. Automaton has 376 states and 584 transitions. Word has length 212 [2025-01-09 10:34:38,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:34:38,200 INFO L471 AbstractCegarLoop]: Abstraction has 376 states and 584 transitions. [2025-01-09 10:34:38,200 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 states have internal predecessors, (50), 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) [2025-01-09 10:34:38,200 INFO L276 IsEmpty]: Start isEmpty. Operand 376 states and 584 transitions. [2025-01-09 10:34:38,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2025-01-09 10:34:38,201 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:34:38,202 INFO L218 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, 1, 1, 1] [2025-01-09 10:34:38,202 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 10:34:38,202 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:34:38,202 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:34:38,202 INFO L85 PathProgramCache]: Analyzing trace with hash -1415218663, now seen corresponding path program 1 times [2025-01-09 10:34:38,202 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:34:38,203 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1228798020] [2025-01-09 10:34:38,203 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:34:38,203 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:34:38,213 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 213 statements into 1 equivalence classes. [2025-01-09 10:34:38,340 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 213 of 213 statements. [2025-01-09 10:34:38,340 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:34:38,340 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat