./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/systemc/transmitter.05.cil.c --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/systemc/transmitter.05.cil.c -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 d8722862ca37b1ee13dec8b9e420cd40ba7901837b8f3b6258499da6e8a2ca6f --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 04:18:00,410 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 04:18:00,478 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-09 04:18:00,483 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 04:18:00,486 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 04:18:00,520 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 04:18:00,521 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 04:18:00,521 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 04:18:00,521 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 04:18:00,522 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 04:18:00,523 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 04:18:00,523 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 04:18:00,523 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 04:18:00,523 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 04:18:00,523 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 04:18:00,524 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 04:18:00,524 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 04:18:00,524 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 04:18:00,524 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 04:18:00,524 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 04:18:00,524 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 04:18:00,525 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 04:18:00,525 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 04:18:00,525 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 04:18:00,525 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 04:18:00,525 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 04:18:00,525 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 04:18:00,525 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 04:18:00,525 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 04:18:00,526 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 04:18:00,526 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 04:18:00,527 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 04:18:00,527 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 04:18:00,527 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 04:18:00,527 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 04:18:00,527 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 04:18:00,527 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 04:18:00,527 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 04:18:00,527 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 04:18:00,528 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 04:18:00,528 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 04:18:00,528 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 04:18:00,528 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 04:18:00,528 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 04:18:00,528 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 04:18:00,528 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 04:18:00,528 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 04:18:00,528 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 04:18:00,529 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 -> d8722862ca37b1ee13dec8b9e420cd40ba7901837b8f3b6258499da6e8a2ca6f [2025-01-09 04:18:00,816 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 04:18:00,828 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 04:18:00,830 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 04:18:00,834 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 04:18:00,834 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 04:18:00,836 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/systemc/transmitter.05.cil.c [2025-01-09 04:18:02,127 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/5a409ae74/5fe3b05fa3a84d6cbf26fca9d2290029/FLAGaa7d23bdf [2025-01-09 04:18:02,387 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 04:18:02,388 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/systemc/transmitter.05.cil.c [2025-01-09 04:18:02,399 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/5a409ae74/5fe3b05fa3a84d6cbf26fca9d2290029/FLAGaa7d23bdf [2025-01-09 04:18:02,418 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/5a409ae74/5fe3b05fa3a84d6cbf26fca9d2290029 [2025-01-09 04:18:02,421 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 04:18:02,422 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 04:18:02,424 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 04:18:02,424 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 04:18:02,428 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 04:18:02,429 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 04:18:02" (1/1) ... [2025-01-09 04:18:02,430 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4805d46a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:18:02, skipping insertion in model container [2025-01-09 04:18:02,430 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 04:18:02" (1/1) ... [2025-01-09 04:18:02,460 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 04:18:02,610 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/systemc/transmitter.05.cil.c[706,719] [2025-01-09 04:18:02,705 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 04:18:02,723 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 04:18:02,732 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/systemc/transmitter.05.cil.c[706,719] [2025-01-09 04:18:02,786 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 04:18:02,804 INFO L204 MainTranslator]: Completed translation [2025-01-09 04:18:02,805 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:18:02 WrapperNode [2025-01-09 04:18:02,806 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 04:18:02,807 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 04:18:02,807 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 04:18:02,807 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 04:18:02,813 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:18:02" (1/1) ... [2025-01-09 04:18:02,820 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:18:02" (1/1) ... [2025-01-09 04:18:02,849 INFO L138 Inliner]: procedures = 38, calls = 45, calls flagged for inlining = 22, calls inlined = 22, statements flattened = 419 [2025-01-09 04:18:02,854 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 04:18:02,854 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 04:18:02,855 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 04:18:02,855 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 04:18:02,865 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:18:02" (1/1) ... [2025-01-09 04:18:02,865 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:18:02" (1/1) ... [2025-01-09 04:18:02,872 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:18:02" (1/1) ... [2025-01-09 04:18:02,895 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 04:18:02,896 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:18:02" (1/1) ... [2025-01-09 04:18:02,896 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:18:02" (1/1) ... [2025-01-09 04:18:02,905 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:18:02" (1/1) ... [2025-01-09 04:18:02,907 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:18:02" (1/1) ... [2025-01-09 04:18:02,916 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:18:02" (1/1) ... [2025-01-09 04:18:02,920 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:18:02" (1/1) ... [2025-01-09 04:18:02,921 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:18:02" (1/1) ... [2025-01-09 04:18:02,923 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 04:18:02,924 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 04:18:02,924 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 04:18:02,924 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 04:18:02,925 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:18:02" (1/1) ... [2025-01-09 04:18:02,934 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 04:18:02,955 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 04:18:02,970 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 04:18:02,975 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 04:18:03,000 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 04:18:03,001 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2025-01-09 04:18:03,002 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2025-01-09 04:18:03,002 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2025-01-09 04:18:03,002 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2025-01-09 04:18:03,002 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2025-01-09 04:18:03,002 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2025-01-09 04:18:03,002 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2025-01-09 04:18:03,002 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2025-01-09 04:18:03,003 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2025-01-09 04:18:03,003 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2025-01-09 04:18:03,003 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 04:18:03,003 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2025-01-09 04:18:03,003 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2025-01-09 04:18:03,003 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 04:18:03,004 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 04:18:03,103 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 04:18:03,105 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 04:18:03,683 INFO L? ?]: Removed 55 outVars from TransFormulas that were not future-live. [2025-01-09 04:18:03,683 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 04:18:03,696 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 04:18:03,696 INFO L312 CfgBuilder]: Removed 9 assume(true) statements. [2025-01-09 04:18:03,696 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 04:18:03 BoogieIcfgContainer [2025-01-09 04:18:03,697 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 04:18:03,698 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 04:18:03,699 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 04:18:03,703 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 04:18:03,703 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 04:18:02" (1/3) ... [2025-01-09 04:18:03,704 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@149b7b8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 04:18:03, skipping insertion in model container [2025-01-09 04:18:03,704 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:18:02" (2/3) ... [2025-01-09 04:18:03,704 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@149b7b8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 04:18:03, skipping insertion in model container [2025-01-09 04:18:03,704 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 04:18:03" (3/3) ... [2025-01-09 04:18:03,707 INFO L128 eAbstractionObserver]: Analyzing ICFG transmitter.05.cil.c [2025-01-09 04:18:03,720 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 04:18:03,724 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG transmitter.05.cil.c that has 7 procedures, 200 locations, 1 initial locations, 9 loop locations, and 1 error locations. [2025-01-09 04:18:03,780 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 04:18:03,789 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;@2e45ad87, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 04:18:03,790 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 04:18:03,796 INFO L276 IsEmpty]: Start isEmpty. Operand has 200 states, 175 states have (on average 1.5714285714285714) internal successors, (275), 176 states have internal predecessors, (275), 18 states have call successors, (18), 6 states have call predecessors, (18), 6 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-01-09 04:18:03,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2025-01-09 04:18:03,807 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:18:03,808 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:18:03,809 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:18:03,814 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:18:03,815 INFO L85 PathProgramCache]: Analyzing trace with hash -1782644430, now seen corresponding path program 1 times [2025-01-09 04:18:03,821 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:18:03,822 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1715936584] [2025-01-09 04:18:03,822 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:18:03,823 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:18:03,925 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-01-09 04:18:03,950 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-01-09 04:18:03,951 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:18:03,951 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:18:04,192 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:18:04,193 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:18:04,193 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1715936584] [2025-01-09 04:18:04,198 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1715936584] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:18:04,198 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:18:04,199 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 04:18:04,200 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1226616533] [2025-01-09 04:18:04,200 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:18:04,208 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:18:04,208 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:18:04,232 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:18:04,233 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:18:04,236 INFO L87 Difference]: Start difference. First operand has 200 states, 175 states have (on average 1.5714285714285714) internal successors, (275), 176 states have internal predecessors, (275), 18 states have call successors, (18), 6 states have call predecessors, (18), 6 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) Second operand has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 04:18:04,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:18:04,309 INFO L93 Difference]: Finished difference Result 393 states and 613 transitions. [2025-01-09 04:18:04,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:18:04,312 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 101 [2025-01-09 04:18:04,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:18:04,324 INFO L225 Difference]: With dead ends: 393 [2025-01-09 04:18:04,325 INFO L226 Difference]: Without dead ends: 195 [2025-01-09 04:18:04,332 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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 04:18:04,337 INFO L435 NwaCegarLoop]: 298 mSDtfsCounter, 294 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 294 SdHoareTripleChecker+Valid, 298 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:18:04,339 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [294 Valid, 298 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:18:04,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2025-01-09 04:18:04,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 195. [2025-01-09 04:18:04,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 195 states, 170 states have (on average 1.5235294117647058) internal successors, (259), 171 states have internal predecessors, (259), 18 states have call successors, (18), 6 states have call predecessors, (18), 6 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-01-09 04:18:04,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 295 transitions. [2025-01-09 04:18:04,421 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 295 transitions. Word has length 101 [2025-01-09 04:18:04,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:18:04,422 INFO L471 AbstractCegarLoop]: Abstraction has 195 states and 295 transitions. [2025-01-09 04:18:04,422 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 04:18:04,423 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 295 transitions. [2025-01-09 04:18:04,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2025-01-09 04:18:04,426 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:18:04,427 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:18:04,427 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 04:18:04,428 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:18:04,428 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:18:04,428 INFO L85 PathProgramCache]: Analyzing trace with hash -163669516, now seen corresponding path program 1 times [2025-01-09 04:18:04,428 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:18:04,428 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1680254515] [2025-01-09 04:18:04,429 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:18:04,429 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:18:04,455 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-01-09 04:18:04,475 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-01-09 04:18:04,478 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:18:04,478 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:18:04,740 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:18:04,741 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:18:04,741 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1680254515] [2025-01-09 04:18:04,741 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1680254515] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:18:04,741 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:18:04,741 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 04:18:04,741 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1172063124] [2025-01-09 04:18:04,741 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:18:04,744 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 04:18:04,744 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:18:04,745 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 04:18:04,746 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 04:18:04,746 INFO L87 Difference]: Start difference. First operand 195 states and 295 transitions. Second operand has 5 states, 5 states have (on average 18.2) internal successors, (91), 4 states have internal predecessors, (91), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 04:18:05,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:18:05,242 INFO L93 Difference]: Finished difference Result 577 states and 891 transitions. [2025-01-09 04:18:05,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 04:18:05,242 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 18.2) internal successors, (91), 4 states have internal predecessors, (91), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 101 [2025-01-09 04:18:05,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:18:05,249 INFO L225 Difference]: With dead ends: 577 [2025-01-09 04:18:05,249 INFO L226 Difference]: Without dead ends: 395 [2025-01-09 04:18:05,250 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-01-09 04:18:05,255 INFO L435 NwaCegarLoop]: 224 mSDtfsCounter, 532 mSDsluCounter, 557 mSDsCounter, 0 mSdLazyCounter, 340 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 544 SdHoareTripleChecker+Valid, 781 SdHoareTripleChecker+Invalid, 381 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 340 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 04:18:05,255 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [544 Valid, 781 Invalid, 381 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 340 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 04:18:05,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 395 states. [2025-01-09 04:18:05,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 395 to 380. [2025-01-09 04:18:05,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 380 states, 335 states have (on average 1.5343283582089553) internal successors, (514), 337 states have internal predecessors, (514), 31 states have call successors, (31), 12 states have call predecessors, (31), 13 states have return successors, (32), 31 states have call predecessors, (32), 31 states have call successors, (32) [2025-01-09 04:18:05,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 380 states and 577 transitions. [2025-01-09 04:18:05,295 INFO L78 Accepts]: Start accepts. Automaton has 380 states and 577 transitions. Word has length 101 [2025-01-09 04:18:05,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:18:05,295 INFO L471 AbstractCegarLoop]: Abstraction has 380 states and 577 transitions. [2025-01-09 04:18:05,295 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.2) internal successors, (91), 4 states have internal predecessors, (91), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 04:18:05,295 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 577 transitions. [2025-01-09 04:18:05,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2025-01-09 04:18:05,298 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:18:05,298 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:18:05,298 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 04:18:05,299 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:18:05,299 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:18:05,299 INFO L85 PathProgramCache]: Analyzing trace with hash 145015221, now seen corresponding path program 1 times [2025-01-09 04:18:05,299 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:18:05,299 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1391183745] [2025-01-09 04:18:05,300 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:18:05,300 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:18:05,320 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-01-09 04:18:05,326 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-01-09 04:18:05,326 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:18:05,326 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:18:05,569 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:18:05,570 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:18:05,570 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1391183745] [2025-01-09 04:18:05,570 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1391183745] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:18:05,570 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:18:05,570 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 04:18:05,570 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1639939362] [2025-01-09 04:18:05,570 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:18:05,571 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 04:18:05,571 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:18:05,572 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 04:18:05,572 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 04:18:05,572 INFO L87 Difference]: Start difference. First operand 380 states and 577 transitions. Second operand has 6 states, 6 states have (on average 15.166666666666666) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 04:18:06,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:18:06,300 INFO L93 Difference]: Finished difference Result 1021 states and 1565 transitions. [2025-01-09 04:18:06,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 04:18:06,301 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 15.166666666666666) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 101 [2025-01-09 04:18:06,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:18:06,307 INFO L225 Difference]: With dead ends: 1021 [2025-01-09 04:18:06,308 INFO L226 Difference]: Without dead ends: 654 [2025-01-09 04:18:06,309 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-01-09 04:18:06,310 INFO L435 NwaCegarLoop]: 376 mSDtfsCounter, 582 mSDsluCounter, 1105 mSDsCounter, 0 mSdLazyCounter, 802 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 594 SdHoareTripleChecker+Valid, 1481 SdHoareTripleChecker+Invalid, 828 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 802 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-09 04:18:06,311 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [594 Valid, 1481 Invalid, 828 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 802 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-09 04:18:06,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 654 states. [2025-01-09 04:18:06,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 654 to 553. [2025-01-09 04:18:06,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 553 states, 488 states have (on average 1.526639344262295) internal successors, (745), 491 states have internal predecessors, (745), 44 states have call successors, (44), 18 states have call predecessors, (44), 20 states have return successors, (48), 45 states have call predecessors, (48), 44 states have call successors, (48) [2025-01-09 04:18:06,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 553 states to 553 states and 837 transitions. [2025-01-09 04:18:06,369 INFO L78 Accepts]: Start accepts. Automaton has 553 states and 837 transitions. Word has length 101 [2025-01-09 04:18:06,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:18:06,370 INFO L471 AbstractCegarLoop]: Abstraction has 553 states and 837 transitions. [2025-01-09 04:18:06,371 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.166666666666666) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 04:18:06,371 INFO L276 IsEmpty]: Start isEmpty. Operand 553 states and 837 transitions. [2025-01-09 04:18:06,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2025-01-09 04:18:06,374 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:18:06,374 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:18:06,374 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 04:18:06,374 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:18:06,375 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:18:06,375 INFO L85 PathProgramCache]: Analyzing trace with hash 2021498039, now seen corresponding path program 1 times [2025-01-09 04:18:06,375 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:18:06,375 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [102902796] [2025-01-09 04:18:06,375 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:18:06,375 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:18:06,391 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-01-09 04:18:06,396 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-01-09 04:18:06,396 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:18:06,397 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:18:06,538 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:18:06,538 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:18:06,540 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [102902796] [2025-01-09 04:18:06,540 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [102902796] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:18:06,540 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:18:06,540 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 04:18:06,540 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1560718947] [2025-01-09 04:18:06,540 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:18:06,541 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 04:18:06,541 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:18:06,542 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 04:18:06,542 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 04:18:06,542 INFO L87 Difference]: Start difference. First operand 553 states and 837 transitions. Second operand has 6 states, 6 states have (on average 15.166666666666666) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 04:18:07,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:18:07,206 INFO L93 Difference]: Finished difference Result 1565 states and 2394 transitions. [2025-01-09 04:18:07,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 04:18:07,207 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 15.166666666666666) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 101 [2025-01-09 04:18:07,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:18:07,215 INFO L225 Difference]: With dead ends: 1565 [2025-01-09 04:18:07,216 INFO L226 Difference]: Without dead ends: 1025 [2025-01-09 04:18:07,219 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-01-09 04:18:07,221 INFO L435 NwaCegarLoop]: 372 mSDtfsCounter, 577 mSDsluCounter, 1093 mSDsCounter, 0 mSdLazyCounter, 802 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 589 SdHoareTripleChecker+Valid, 1465 SdHoareTripleChecker+Invalid, 828 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 802 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-09 04:18:07,223 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [589 Valid, 1465 Invalid, 828 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 802 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-09 04:18:07,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1025 states. [2025-01-09 04:18:07,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1025 to 918. [2025-01-09 04:18:07,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 918 states, 811 states have (on average 1.526510480887793) internal successors, (1238), 818 states have internal predecessors, (1238), 70 states have call successors, (70), 30 states have call predecessors, (70), 36 states have return successors, (86), 73 states have call predecessors, (86), 70 states have call successors, (86) [2025-01-09 04:18:07,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 918 states to 918 states and 1394 transitions. [2025-01-09 04:18:07,311 INFO L78 Accepts]: Start accepts. Automaton has 918 states and 1394 transitions. Word has length 101 [2025-01-09 04:18:07,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:18:07,312 INFO L471 AbstractCegarLoop]: Abstraction has 918 states and 1394 transitions. [2025-01-09 04:18:07,313 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.166666666666666) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 04:18:07,313 INFO L276 IsEmpty]: Start isEmpty. Operand 918 states and 1394 transitions. [2025-01-09 04:18:07,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2025-01-09 04:18:07,315 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:18:07,315 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:18:07,316 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 04:18:07,316 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:18:07,316 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:18:07,316 INFO L85 PathProgramCache]: Analyzing trace with hash 142367093, now seen corresponding path program 1 times [2025-01-09 04:18:07,317 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:18:07,317 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1525871145] [2025-01-09 04:18:07,317 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:18:07,317 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:18:07,329 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-01-09 04:18:07,333 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-01-09 04:18:07,334 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:18:07,334 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:18:07,464 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:18:07,464 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:18:07,464 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1525871145] [2025-01-09 04:18:07,465 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1525871145] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:18:07,465 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:18:07,465 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 04:18:07,465 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1991115250] [2025-01-09 04:18:07,465 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:18:07,465 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 04:18:07,465 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:18:07,466 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 04:18:07,466 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 04:18:07,466 INFO L87 Difference]: Start difference. First operand 918 states and 1394 transitions. Second operand has 6 states, 6 states have (on average 15.166666666666666) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 04:18:08,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:18:08,177 INFO L93 Difference]: Finished difference Result 2724 states and 4197 transitions. [2025-01-09 04:18:08,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 04:18:08,177 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 15.166666666666666) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 101 [2025-01-09 04:18:08,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:18:08,190 INFO L225 Difference]: With dead ends: 2724 [2025-01-09 04:18:08,191 INFO L226 Difference]: Without dead ends: 1819 [2025-01-09 04:18:08,194 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-01-09 04:18:08,195 INFO L435 NwaCegarLoop]: 369 mSDtfsCounter, 572 mSDsluCounter, 1084 mSDsCounter, 0 mSdLazyCounter, 802 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 584 SdHoareTripleChecker+Valid, 1453 SdHoareTripleChecker+Invalid, 828 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 802 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-09 04:18:08,196 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [584 Valid, 1453 Invalid, 828 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 802 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-09 04:18:08,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1819 states. [2025-01-09 04:18:08,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1819 to 1699. [2025-01-09 04:18:08,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1699 states, 1502 states have (on average 1.5352862849533955) internal successors, (2306), 1523 states have internal predecessors, (2306), 122 states have call successors, (122), 54 states have call predecessors, (122), 74 states have return successors, (186), 129 states have call predecessors, (186), 122 states have call successors, (186) [2025-01-09 04:18:08,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1699 states to 1699 states and 2614 transitions. [2025-01-09 04:18:08,360 INFO L78 Accepts]: Start accepts. Automaton has 1699 states and 2614 transitions. Word has length 101 [2025-01-09 04:18:08,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:18:08,362 INFO L471 AbstractCegarLoop]: Abstraction has 1699 states and 2614 transitions. [2025-01-09 04:18:08,362 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.166666666666666) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 04:18:08,363 INFO L276 IsEmpty]: Start isEmpty. Operand 1699 states and 2614 transitions. [2025-01-09 04:18:08,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2025-01-09 04:18:08,369 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:18:08,369 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:18:08,369 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 04:18:08,370 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:18:08,373 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:18:08,374 INFO L85 PathProgramCache]: Analyzing trace with hash 1467223287, now seen corresponding path program 1 times [2025-01-09 04:18:08,374 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:18:08,374 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1860583392] [2025-01-09 04:18:08,374 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:18:08,374 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:18:08,390 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-01-09 04:18:08,395 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-01-09 04:18:08,396 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:18:08,396 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:18:08,522 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:18:08,522 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:18:08,523 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1860583392] [2025-01-09 04:18:08,523 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1860583392] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:18:08,523 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:18:08,523 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 04:18:08,523 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1333365216] [2025-01-09 04:18:08,523 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:18:08,524 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 04:18:08,524 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:18:08,524 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 04:18:08,524 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 04:18:08,525 INFO L87 Difference]: Start difference. First operand 1699 states and 2614 transitions. Second operand has 6 states, 6 states have (on average 15.166666666666666) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 04:18:09,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:18:09,329 INFO L93 Difference]: Finished difference Result 5227 states and 8215 transitions. [2025-01-09 04:18:09,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 04:18:09,329 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 15.166666666666666) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 101 [2025-01-09 04:18:09,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:18:09,351 INFO L225 Difference]: With dead ends: 5227 [2025-01-09 04:18:09,351 INFO L226 Difference]: Without dead ends: 3541 [2025-01-09 04:18:09,357 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-01-09 04:18:09,357 INFO L435 NwaCegarLoop]: 366 mSDtfsCounter, 567 mSDsluCounter, 1075 mSDsCounter, 0 mSdLazyCounter, 802 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 579 SdHoareTripleChecker+Valid, 1441 SdHoareTripleChecker+Invalid, 828 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 802 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-09 04:18:09,358 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [579 Valid, 1441 Invalid, 828 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 802 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-09 04:18:09,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3541 states. [2025-01-09 04:18:09,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3541 to 3396. [2025-01-09 04:18:09,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3396 states, 3001 states have (on average 1.550816394535155) internal successors, (4654), 3068 states have internal predecessors, (4654), 226 states have call successors, (226), 102 states have call predecessors, (226), 168 states have return successors, (482), 241 states have call predecessors, (482), 226 states have call successors, (482) [2025-01-09 04:18:09,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3396 states to 3396 states and 5362 transitions. [2025-01-09 04:18:09,589 INFO L78 Accepts]: Start accepts. Automaton has 3396 states and 5362 transitions. Word has length 101 [2025-01-09 04:18:09,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:18:09,590 INFO L471 AbstractCegarLoop]: Abstraction has 3396 states and 5362 transitions. [2025-01-09 04:18:09,590 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.166666666666666) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 04:18:09,590 INFO L276 IsEmpty]: Start isEmpty. Operand 3396 states and 5362 transitions. [2025-01-09 04:18:09,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2025-01-09 04:18:09,595 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:18:09,595 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:18:09,596 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 04:18:09,596 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:18:09,596 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:18:09,596 INFO L85 PathProgramCache]: Analyzing trace with hash -1260986059, now seen corresponding path program 1 times [2025-01-09 04:18:09,596 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:18:09,597 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1774506511] [2025-01-09 04:18:09,597 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:18:09,597 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:18:09,608 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-01-09 04:18:09,611 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-01-09 04:18:09,612 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:18:09,612 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:18:09,711 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:18:09,711 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:18:09,711 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1774506511] [2025-01-09 04:18:09,712 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1774506511] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:18:09,712 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:18:09,712 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 04:18:09,712 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [782448370] [2025-01-09 04:18:09,712 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:18:09,712 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 04:18:09,712 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:18:09,713 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 04:18:09,713 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 04:18:09,713 INFO L87 Difference]: Start difference. First operand 3396 states and 5362 transitions. Second operand has 6 states, 6 states have (on average 15.166666666666666) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 04:18:10,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:18:10,694 INFO L93 Difference]: Finished difference Result 11142 states and 18050 transitions. [2025-01-09 04:18:10,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 04:18:10,695 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 15.166666666666666) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 101 [2025-01-09 04:18:10,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:18:10,748 INFO L225 Difference]: With dead ends: 11142 [2025-01-09 04:18:10,748 INFO L226 Difference]: Without dead ends: 7759 [2025-01-09 04:18:10,760 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-01-09 04:18:10,761 INFO L435 NwaCegarLoop]: 352 mSDtfsCounter, 602 mSDsluCounter, 1045 mSDsCounter, 0 mSdLazyCounter, 814 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 613 SdHoareTripleChecker+Valid, 1397 SdHoareTripleChecker+Invalid, 842 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 814 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-09 04:18:10,762 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [613 Valid, 1397 Invalid, 842 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 814 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-09 04:18:10,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7759 states. [2025-01-09 04:18:11,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7759 to 7012. [2025-01-09 04:18:11,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7012 states, 6183 states have (on average 1.566876920588711) internal successors, (9688), 6396 states have internal predecessors, (9688), 418 states have call successors, (418), 198 states have call predecessors, (418), 410 states have return successors, (1442), 449 states have call predecessors, (1442), 418 states have call successors, (1442) [2025-01-09 04:18:11,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7012 states to 7012 states and 11548 transitions. [2025-01-09 04:18:11,199 INFO L78 Accepts]: Start accepts. Automaton has 7012 states and 11548 transitions. Word has length 101 [2025-01-09 04:18:11,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:18:11,199 INFO L471 AbstractCegarLoop]: Abstraction has 7012 states and 11548 transitions. [2025-01-09 04:18:11,199 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.166666666666666) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 04:18:11,200 INFO L276 IsEmpty]: Start isEmpty. Operand 7012 states and 11548 transitions. [2025-01-09 04:18:11,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2025-01-09 04:18:11,209 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:18:11,209 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:18:11,209 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 04:18:11,209 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:18:11,210 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:18:11,210 INFO L85 PathProgramCache]: Analyzing trace with hash 1891478771, now seen corresponding path program 1 times [2025-01-09 04:18:11,210 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:18:11,210 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [602919616] [2025-01-09 04:18:11,210 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:18:11,211 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:18:11,218 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-01-09 04:18:11,221 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-01-09 04:18:11,222 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:18:11,222 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:18:11,322 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:18:11,323 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:18:11,323 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [602919616] [2025-01-09 04:18:11,323 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [602919616] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:18:11,323 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:18:11,323 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 04:18:11,323 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1920607161] [2025-01-09 04:18:11,323 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:18:11,324 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 04:18:11,324 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:18:11,324 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 04:18:11,325 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 04:18:11,325 INFO L87 Difference]: Start difference. First operand 7012 states and 11548 transitions. Second operand has 6 states, 6 states have (on average 15.166666666666666) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 04:18:12,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:18:12,645 INFO L93 Difference]: Finished difference Result 23084 states and 39670 transitions. [2025-01-09 04:18:12,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 04:18:12,647 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 15.166666666666666) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 101 [2025-01-09 04:18:12,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:18:12,757 INFO L225 Difference]: With dead ends: 23084 [2025-01-09 04:18:12,758 INFO L226 Difference]: Without dead ends: 16085 [2025-01-09 04:18:12,786 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-01-09 04:18:12,786 INFO L435 NwaCegarLoop]: 228 mSDtfsCounter, 685 mSDsluCounter, 754 mSDsCounter, 0 mSdLazyCounter, 607 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 702 SdHoareTripleChecker+Valid, 982 SdHoareTripleChecker+Invalid, 650 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 607 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-09 04:18:12,787 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [702 Valid, 982 Invalid, 650 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 607 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-09 04:18:12,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16085 states. [2025-01-09 04:18:13,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16085 to 14925. [2025-01-09 04:18:13,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14925 states, 13082 states have (on average 1.5807980431126738) internal successors, (20680), 13749 states have internal predecessors, (20680), 786 states have call successors, (786), 390 states have call predecessors, (786), 1056 states have return successors, (4882), 849 states have call predecessors, (4882), 786 states have call successors, (4882) [2025-01-09 04:18:13,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14925 states to 14925 states and 26348 transitions. [2025-01-09 04:18:13,929 INFO L78 Accepts]: Start accepts. Automaton has 14925 states and 26348 transitions. Word has length 101 [2025-01-09 04:18:13,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:18:13,930 INFO L471 AbstractCegarLoop]: Abstraction has 14925 states and 26348 transitions. [2025-01-09 04:18:13,931 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.166666666666666) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 04:18:13,931 INFO L276 IsEmpty]: Start isEmpty. Operand 14925 states and 26348 transitions. [2025-01-09 04:18:13,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2025-01-09 04:18:13,947 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:18:13,947 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:18:13,947 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 04:18:13,947 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:18:13,948 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:18:13,948 INFO L85 PathProgramCache]: Analyzing trace with hash 2131718517, now seen corresponding path program 1 times [2025-01-09 04:18:13,948 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:18:13,948 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [503917480] [2025-01-09 04:18:13,948 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:18:13,948 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:18:13,957 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-01-09 04:18:13,963 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-01-09 04:18:13,963 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:18:13,963 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:18:14,060 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:18:14,060 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:18:14,060 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [503917480] [2025-01-09 04:18:14,061 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [503917480] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:18:14,061 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:18:14,061 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 04:18:14,061 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [11576231] [2025-01-09 04:18:14,061 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:18:14,062 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 04:18:14,062 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:18:14,062 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 04:18:14,062 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 04:18:14,063 INFO L87 Difference]: Start difference. First operand 14925 states and 26348 transitions. Second operand has 6 states, 6 states have (on average 15.166666666666666) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 04:18:16,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:18:16,263 INFO L93 Difference]: Finished difference Result 49001 states and 92872 transitions. [2025-01-09 04:18:16,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 04:18:16,264 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 15.166666666666666) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 101 [2025-01-09 04:18:16,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:18:16,518 INFO L225 Difference]: With dead ends: 49001 [2025-01-09 04:18:16,519 INFO L226 Difference]: Without dead ends: 34089 [2025-01-09 04:18:16,600 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-01-09 04:18:16,601 INFO L435 NwaCegarLoop]: 346 mSDtfsCounter, 623 mSDsluCounter, 1027 mSDsCounter, 0 mSdLazyCounter, 736 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 640 SdHoareTripleChecker+Valid, 1373 SdHoareTripleChecker+Invalid, 765 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 736 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-09 04:18:16,602 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [640 Valid, 1373 Invalid, 765 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 736 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-09 04:18:16,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34089 states. [2025-01-09 04:18:19,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34089 to 32356. [2025-01-09 04:18:19,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32356 states, 28031 states have (on average 1.5879561913595661) internal successors, (44512), 30092 states have internal predecessors, (44512), 1490 states have call successors, (1490), 774 states have call predecessors, (1490), 2834 states have return successors, (17874), 1617 states have call predecessors, (17874), 1490 states have call successors, (17874) [2025-01-09 04:18:19,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32356 states to 32356 states and 63876 transitions. [2025-01-09 04:18:19,411 INFO L78 Accepts]: Start accepts. Automaton has 32356 states and 63876 transitions. Word has length 101 [2025-01-09 04:18:19,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:18:19,411 INFO L471 AbstractCegarLoop]: Abstraction has 32356 states and 63876 transitions. [2025-01-09 04:18:19,412 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.166666666666666) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 04:18:19,412 INFO L276 IsEmpty]: Start isEmpty. Operand 32356 states and 63876 transitions. [2025-01-09 04:18:19,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2025-01-09 04:18:19,449 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:18:19,449 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:18:19,450 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 04:18:19,451 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:18:19,452 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:18:19,452 INFO L85 PathProgramCache]: Analyzing trace with hash -1324215117, now seen corresponding path program 1 times [2025-01-09 04:18:19,452 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:18:19,452 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2126197317] [2025-01-09 04:18:19,452 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:18:19,453 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:18:19,462 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-01-09 04:18:19,465 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-01-09 04:18:19,466 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:18:19,466 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:18:19,577 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:18:19,578 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:18:19,578 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2126197317] [2025-01-09 04:18:19,578 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2126197317] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:18:19,578 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:18:19,578 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 04:18:19,578 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1628178162] [2025-01-09 04:18:19,578 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:18:19,578 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 04:18:19,579 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:18:19,579 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 04:18:19,579 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 04:18:19,579 INFO L87 Difference]: Start difference. First operand 32356 states and 63876 transitions. Second operand has 6 states, 6 states have (on average 15.166666666666666) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 04:18:23,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:18:23,080 INFO L93 Difference]: Finished difference Result 105384 states and 233582 transitions. [2025-01-09 04:18:23,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 04:18:23,080 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 15.166666666666666) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 101 [2025-01-09 04:18:23,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:18:23,747 INFO L225 Difference]: With dead ends: 105384 [2025-01-09 04:18:23,748 INFO L226 Difference]: Without dead ends: 73041 [2025-01-09 04:18:23,900 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-01-09 04:18:23,901 INFO L435 NwaCegarLoop]: 343 mSDtfsCounter, 557 mSDsluCounter, 1018 mSDsCounter, 0 mSdLazyCounter, 814 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 568 SdHoareTripleChecker+Valid, 1361 SdHoareTripleChecker+Invalid, 842 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 814 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-09 04:18:23,902 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [568 Valid, 1361 Invalid, 842 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 814 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-09 04:18:23,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73041 states. [2025-01-09 04:18:29,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73041 to 70671. [2025-01-09 04:18:30,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70671 states, 59988 states have (on average 1.5819830632793226) internal successors, (94900), 66295 states have internal predecessors, (94900), 2834 states have call successors, (2834), 1542 states have call predecessors, (2834), 7848 states have return successors, (68370), 3089 states have call predecessors, (68370), 2834 states have call successors, (68370) [2025-01-09 04:18:30,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70671 states to 70671 states and 166104 transitions. [2025-01-09 04:18:30,620 INFO L78 Accepts]: Start accepts. Automaton has 70671 states and 166104 transitions. Word has length 101 [2025-01-09 04:18:30,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:18:30,621 INFO L471 AbstractCegarLoop]: Abstraction has 70671 states and 166104 transitions. [2025-01-09 04:18:30,622 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.166666666666666) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 04:18:30,622 INFO L276 IsEmpty]: Start isEmpty. Operand 70671 states and 166104 transitions. [2025-01-09 04:18:30,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2025-01-09 04:18:30,682 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:18:30,682 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:18:30,683 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 04:18:30,683 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:18:30,683 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:18:30,683 INFO L85 PathProgramCache]: Analyzing trace with hash -1297149515, now seen corresponding path program 1 times [2025-01-09 04:18:30,684 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:18:30,684 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1338515145] [2025-01-09 04:18:30,684 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:18:30,684 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:18:30,692 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-01-09 04:18:30,695 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-01-09 04:18:30,697 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:18:30,697 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:18:30,804 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:18:30,807 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:18:30,808 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1338515145] [2025-01-09 04:18:30,808 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1338515145] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:18:30,808 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:18:30,808 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 04:18:30,808 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1669784753] [2025-01-09 04:18:30,808 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:18:30,808 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 04:18:30,808 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:18:30,809 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 04:18:30,809 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 04:18:30,809 INFO L87 Difference]: Start difference. First operand 70671 states and 166104 transitions. Second operand has 5 states, 5 states have (on average 18.2) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 04:18:36,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:18:36,434 INFO L93 Difference]: Finished difference Result 154455 states and 404803 transitions. [2025-01-09 04:18:36,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 04:18:36,435 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 18.2) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 101 [2025-01-09 04:18:36,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:18:37,317 INFO L225 Difference]: With dead ends: 154455 [2025-01-09 04:18:37,317 INFO L226 Difference]: Without dead ends: 83797 [2025-01-09 04:18:37,554 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-01-09 04:18:37,554 INFO L435 NwaCegarLoop]: 195 mSDtfsCounter, 374 mSDsluCounter, 309 mSDsCounter, 0 mSdLazyCounter, 246 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 386 SdHoareTripleChecker+Valid, 504 SdHoareTripleChecker+Invalid, 273 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 246 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 04:18:37,554 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [386 Valid, 504 Invalid, 273 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 246 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 04:18:37,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83797 states.