./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-89.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version fca748b1 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-89.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash f2d013ffa4d7cd59307ce87b23dd696caa1ad1374742fbf879c50e37b4a890a2 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dd.update-z3-fca748b-m [2024-11-20 08:41:07,045 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-20 08:41:07,111 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-20 08:41:07,117 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-20 08:41:07,120 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-20 08:41:07,151 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-20 08:41:07,152 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-20 08:41:07,152 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-20 08:41:07,153 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-20 08:41:07,156 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-20 08:41:07,157 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-20 08:41:07,157 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-20 08:41:07,158 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-20 08:41:07,158 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-20 08:41:07,158 INFO L153 SettingsManager]: * Use SBE=true [2024-11-20 08:41:07,158 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-20 08:41:07,159 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-20 08:41:07,159 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-20 08:41:07,159 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-20 08:41:07,159 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-20 08:41:07,159 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-20 08:41:07,161 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-20 08:41:07,161 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-20 08:41:07,161 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-20 08:41:07,161 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-20 08:41:07,161 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-20 08:41:07,162 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-20 08:41:07,162 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-20 08:41:07,162 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-20 08:41:07,162 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-20 08:41:07,162 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-20 08:41:07,163 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-20 08:41:07,163 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 08:41:07,163 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-20 08:41:07,163 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-20 08:41:07,163 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-20 08:41:07,164 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-20 08:41:07,164 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-20 08:41:07,164 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-20 08:41:07,164 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-20 08:41:07,165 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-20 08:41:07,165 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-20 08:41:07,165 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> f2d013ffa4d7cd59307ce87b23dd696caa1ad1374742fbf879c50e37b4a890a2 [2024-11-20 08:41:07,394 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-20 08:41:07,421 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-20 08:41:07,424 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-20 08:41:07,425 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-20 08:41:07,426 INFO L274 PluginConnector]: CDTParser initialized [2024-11-20 08:41:07,427 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-89.i [2024-11-20 08:41:08,897 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-20 08:41:09,098 INFO L384 CDTParser]: Found 1 translation units. [2024-11-20 08:41:09,099 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-89.i [2024-11-20 08:41:09,114 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c542a51d1/2de1590b7d4d47d5a6e5dcf7e974c00d/FLAG20480951c [2024-11-20 08:41:09,462 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c542a51d1/2de1590b7d4d47d5a6e5dcf7e974c00d [2024-11-20 08:41:09,464 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-20 08:41:09,466 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-20 08:41:09,469 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-20 08:41:09,469 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-20 08:41:09,475 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-20 08:41:09,476 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 08:41:09" (1/1) ... [2024-11-20 08:41:09,479 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@10043b1a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:41:09, skipping insertion in model container [2024-11-20 08:41:09,479 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 08:41:09" (1/1) ... [2024-11-20 08:41:09,510 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-20 08:41:09,666 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-89.i[917,930] [2024-11-20 08:41:09,735 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 08:41:09,746 INFO L200 MainTranslator]: Completed pre-run [2024-11-20 08:41:09,757 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-89.i[917,930] [2024-11-20 08:41:09,788 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 08:41:09,811 INFO L204 MainTranslator]: Completed translation [2024-11-20 08:41:09,815 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:41:09 WrapperNode [2024-11-20 08:41:09,815 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-20 08:41:09,816 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-20 08:41:09,817 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-20 08:41:09,817 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-20 08:41:09,824 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:41:09" (1/1) ... [2024-11-20 08:41:09,835 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:41:09" (1/1) ... [2024-11-20 08:41:09,872 INFO L138 Inliner]: procedures = 26, calls = 136, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 448 [2024-11-20 08:41:09,872 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-20 08:41:09,873 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-20 08:41:09,873 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-20 08:41:09,873 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-20 08:41:09,883 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:41:09" (1/1) ... [2024-11-20 08:41:09,883 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:41:09" (1/1) ... [2024-11-20 08:41:09,895 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:41:09" (1/1) ... [2024-11-20 08:41:09,916 INFO L175 MemorySlicer]: Split 107 memory accesses to 6 slices as follows [2, 44, 29, 5, 13, 14]. 41 percent of accesses are in the largest equivalence class. The 14 initializations are split as follows [2, 5, 3, 1, 1, 2]. The 15 writes are split as follows [0, 8, 3, 1, 1, 2]. [2024-11-20 08:41:09,917 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:41:09" (1/1) ... [2024-11-20 08:41:09,917 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:41:09" (1/1) ... [2024-11-20 08:41:09,930 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:41:09" (1/1) ... [2024-11-20 08:41:09,934 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:41:09" (1/1) ... [2024-11-20 08:41:09,936 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:41:09" (1/1) ... [2024-11-20 08:41:09,939 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:41:09" (1/1) ... [2024-11-20 08:41:09,943 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-20 08:41:09,944 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-20 08:41:09,944 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-20 08:41:09,944 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-20 08:41:09,945 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:41:09" (1/1) ... [2024-11-20 08:41:09,957 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 08:41:09,968 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 08:41:09,985 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-20 08:41:09,992 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-20 08:41:10,045 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-20 08:41:10,046 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-20 08:41:10,046 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-20 08:41:10,046 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-20 08:41:10,046 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-11-20 08:41:10,046 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2024-11-20 08:41:10,046 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2024-11-20 08:41:10,046 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-20 08:41:10,047 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-20 08:41:10,047 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-20 08:41:10,047 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-11-20 08:41:10,047 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2024-11-20 08:41:10,047 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2024-11-20 08:41:10,047 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-20 08:41:10,047 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-20 08:41:10,047 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-20 08:41:10,047 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-20 08:41:10,048 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-20 08:41:10,048 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-11-20 08:41:10,048 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-11-20 08:41:10,048 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2024-11-20 08:41:10,048 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-20 08:41:10,048 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-20 08:41:10,173 INFO L238 CfgBuilder]: Building ICFG [2024-11-20 08:41:10,174 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-20 08:41:10,638 INFO L? ?]: Removed 96 outVars from TransFormulas that were not future-live. [2024-11-20 08:41:10,638 INFO L287 CfgBuilder]: Performing block encoding [2024-11-20 08:41:10,658 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-20 08:41:10,658 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-20 08:41:10,659 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 08:41:10 BoogieIcfgContainer [2024-11-20 08:41:10,659 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-20 08:41:10,661 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-20 08:41:10,661 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-20 08:41:10,663 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-20 08:41:10,664 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 08:41:09" (1/3) ... [2024-11-20 08:41:10,664 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@aa40cfb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 08:41:10, skipping insertion in model container [2024-11-20 08:41:10,664 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:41:09" (2/3) ... [2024-11-20 08:41:10,664 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@aa40cfb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 08:41:10, skipping insertion in model container [2024-11-20 08:41:10,665 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 08:41:10" (3/3) ... [2024-11-20 08:41:10,665 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-ap_file-89.i [2024-11-20 08:41:10,679 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-20 08:41:10,679 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-20 08:41:10,735 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-20 08:41:10,744 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;@465f4cb5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-20 08:41:10,744 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-20 08:41:10,749 INFO L276 IsEmpty]: Start isEmpty. Operand has 102 states, 86 states have (on average 1.441860465116279) internal successors, (124), 87 states have internal predecessors, (124), 13 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-20 08:41:10,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-11-20 08:41:10,761 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 08:41:10,762 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 08:41:10,762 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 08:41:10,767 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 08:41:10,768 INFO L85 PathProgramCache]: Analyzing trace with hash 80080085, now seen corresponding path program 1 times [2024-11-20 08:41:10,776 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 08:41:10,777 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1998521934] [2024-11-20 08:41:10,777 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 08:41:10,778 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 08:41:10,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:41:11,068 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 08:41:11,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:41:11,079 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-20 08:41:11,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:41:11,086 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-20 08:41:11,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:41:11,094 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-20 08:41:11,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:41:11,109 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-20 08:41:11,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:41:11,117 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-20 08:41:11,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:41:11,121 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-20 08:41:11,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:41:11,126 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-20 08:41:11,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:41:11,136 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-20 08:41:11,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:41:11,144 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-20 08:41:11,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:41:11,151 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-20 08:41:11,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:41:11,157 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-20 08:41:11,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:41:11,165 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-20 08:41:11,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:41:11,178 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-11-20 08:41:11,179 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 08:41:11,182 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1998521934] [2024-11-20 08:41:11,183 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1998521934] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 08:41:11,183 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 08:41:11,183 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-20 08:41:11,185 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [958305497] [2024-11-20 08:41:11,185 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 08:41:11,193 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-20 08:41:11,194 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 08:41:11,259 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-20 08:41:11,261 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-20 08:41:11,263 INFO L87 Difference]: Start difference. First operand has 102 states, 86 states have (on average 1.441860465116279) internal successors, (124), 87 states have internal predecessors, (124), 13 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) Second operand has 2 states, 2 states have (on average 23.5) internal successors, (47), 2 states have internal predecessors, (47), 2 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 2 states have call successors, (13) [2024-11-20 08:41:11,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 08:41:11,321 INFO L93 Difference]: Finished difference Result 197 states and 307 transitions. [2024-11-20 08:41:11,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-20 08:41:11,323 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 23.5) internal successors, (47), 2 states have internal predecessors, (47), 2 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 2 states have call successors, (13) Word has length 109 [2024-11-20 08:41:11,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 08:41:11,331 INFO L225 Difference]: With dead ends: 197 [2024-11-20 08:41:11,331 INFO L226 Difference]: Without dead ends: 98 [2024-11-20 08:41:11,335 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-20 08:41:11,338 INFO L432 NwaCegarLoop]: 141 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 141 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-20 08:41:11,339 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 141 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 08:41:11,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2024-11-20 08:41:11,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2024-11-20 08:41:11,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 83 states have (on average 1.3855421686746987) internal successors, (115), 83 states have internal predecessors, (115), 13 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-20 08:41:11,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 141 transitions. [2024-11-20 08:41:11,389 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 141 transitions. Word has length 109 [2024-11-20 08:41:11,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 08:41:11,390 INFO L471 AbstractCegarLoop]: Abstraction has 98 states and 141 transitions. [2024-11-20 08:41:11,390 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 23.5) internal successors, (47), 2 states have internal predecessors, (47), 2 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 2 states have call successors, (13) [2024-11-20 08:41:11,391 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 141 transitions. [2024-11-20 08:41:11,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-11-20 08:41:11,395 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 08:41:11,395 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 08:41:11,395 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-20 08:41:11,396 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 08:41:11,396 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 08:41:11,396 INFO L85 PathProgramCache]: Analyzing trace with hash 231956475, now seen corresponding path program 1 times [2024-11-20 08:41:11,397 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 08:41:11,397 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [153120679] [2024-11-20 08:41:11,397 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 08:41:11,398 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 08:41:11,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:41:11,682 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 08:41:11,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:41:11,687 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-20 08:41:11,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:41:11,691 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-20 08:41:11,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:41:11,693 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-20 08:41:11,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:41:11,700 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-20 08:41:11,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:41:11,708 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-20 08:41:11,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:41:11,713 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-20 08:41:11,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:41:11,717 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-20 08:41:11,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:41:11,720 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-20 08:41:11,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:41:11,724 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-20 08:41:11,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:41:11,729 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-20 08:41:11,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:41:11,734 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-20 08:41:11,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:41:11,737 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-20 08:41:11,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:41:11,744 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-11-20 08:41:11,744 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 08:41:11,745 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [153120679] [2024-11-20 08:41:11,745 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [153120679] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 08:41:11,745 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 08:41:11,745 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-20 08:41:11,745 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1697806034] [2024-11-20 08:41:11,745 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 08:41:11,746 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-20 08:41:11,747 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 08:41:11,747 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-20 08:41:11,748 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-20 08:41:11,748 INFO L87 Difference]: Start difference. First operand 98 states and 141 transitions. Second operand has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-11-20 08:41:11,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 08:41:11,804 INFO L93 Difference]: Finished difference Result 196 states and 283 transitions. [2024-11-20 08:41:11,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-20 08:41:11,807 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 109 [2024-11-20 08:41:11,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 08:41:11,810 INFO L225 Difference]: With dead ends: 196 [2024-11-20 08:41:11,810 INFO L226 Difference]: Without dead ends: 101 [2024-11-20 08:41:11,811 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-20 08:41:11,813 INFO L432 NwaCegarLoop]: 138 mSDtfsCounter, 1 mSDsluCounter, 265 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 403 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-20 08:41:11,814 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 403 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 08:41:11,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2024-11-20 08:41:11,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 100. [2024-11-20 08:41:11,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 85 states have (on average 1.3764705882352941) internal successors, (117), 85 states have internal predecessors, (117), 13 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-20 08:41:11,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 143 transitions. [2024-11-20 08:41:11,829 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 143 transitions. Word has length 109 [2024-11-20 08:41:11,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 08:41:11,830 INFO L471 AbstractCegarLoop]: Abstraction has 100 states and 143 transitions. [2024-11-20 08:41:11,830 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-11-20 08:41:11,830 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 143 transitions. [2024-11-20 08:41:11,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-11-20 08:41:11,833 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 08:41:11,833 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 08:41:11,833 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-20 08:41:11,833 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 08:41:11,834 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 08:41:11,834 INFO L85 PathProgramCache]: Analyzing trace with hash 912014845, now seen corresponding path program 1 times [2024-11-20 08:41:11,834 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 08:41:11,834 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1411605066] [2024-11-20 08:41:11,834 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 08:41:11,834 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 08:41:11,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:41:12,138 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 08:41:12,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:41:12,144 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-20 08:41:12,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:41:12,151 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-20 08:41:12,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:41:12,158 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-20 08:41:12,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:41:12,163 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-20 08:41:12,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:41:12,167 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-20 08:41:12,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:41:12,170 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-20 08:41:12,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:41:12,172 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-20 08:41:12,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:41:12,175 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-20 08:41:12,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:41:12,178 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-20 08:41:12,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:41:12,185 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-20 08:41:12,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:41:12,187 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-20 08:41:12,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:41:12,188 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-20 08:41:12,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:41:12,191 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-11-20 08:41:12,191 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 08:41:12,191 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1411605066] [2024-11-20 08:41:12,191 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1411605066] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 08:41:12,191 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 08:41:12,192 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-20 08:41:12,192 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1107897875] [2024-11-20 08:41:12,192 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 08:41:12,192 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-20 08:41:12,193 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 08:41:12,193 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-20 08:41:12,193 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-20 08:41:12,194 INFO L87 Difference]: Start difference. First operand 100 states and 143 transitions. Second operand has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-11-20 08:41:12,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 08:41:12,228 INFO L93 Difference]: Finished difference Result 200 states and 287 transitions. [2024-11-20 08:41:12,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-20 08:41:12,232 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 109 [2024-11-20 08:41:12,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 08:41:12,234 INFO L225 Difference]: With dead ends: 200 [2024-11-20 08:41:12,234 INFO L226 Difference]: Without dead ends: 103 [2024-11-20 08:41:12,235 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-20 08:41:12,236 INFO L432 NwaCegarLoop]: 138 mSDtfsCounter, 1 mSDsluCounter, 266 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 404 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-20 08:41:12,236 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 404 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 08:41:12,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2024-11-20 08:41:12,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 102. [2024-11-20 08:41:12,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 87 states have (on average 1.367816091954023) internal successors, (119), 87 states have internal predecessors, (119), 13 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-20 08:41:12,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 145 transitions. [2024-11-20 08:41:12,257 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 145 transitions. Word has length 109 [2024-11-20 08:41:12,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 08:41:12,258 INFO L471 AbstractCegarLoop]: Abstraction has 102 states and 145 transitions. [2024-11-20 08:41:12,258 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-11-20 08:41:12,258 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 145 transitions. [2024-11-20 08:41:12,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-11-20 08:41:12,259 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 08:41:12,260 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 08:41:12,260 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-20 08:41:12,260 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 08:41:12,261 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 08:41:12,261 INFO L85 PathProgramCache]: Analyzing trace with hash -1607945089, now seen corresponding path program 1 times [2024-11-20 08:41:12,261 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 08:41:12,261 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1772148802] [2024-11-20 08:41:12,261 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 08:41:12,261 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 08:41:12,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:41:12,411 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 08:41:12,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:41:12,415 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-20 08:41:12,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:41:12,417 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-20 08:41:12,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:41:12,420 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-20 08:41:12,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:41:12,422 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-20 08:41:12,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:41:12,426 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-20 08:41:12,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:41:12,429 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-20 08:41:12,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:41:12,432 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-20 08:41:12,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:41:12,436 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-20 08:41:12,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:41:12,440 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-20 08:41:12,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:41:12,444 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-20 08:41:12,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:41:12,446 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-20 08:41:12,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:41:12,449 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-20 08:41:12,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:41:12,453 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-11-20 08:41:12,454 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 08:41:12,454 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1772148802] [2024-11-20 08:41:12,455 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1772148802] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 08:41:12,455 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 08:41:12,455 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-20 08:41:12,455 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [281131306] [2024-11-20 08:41:12,455 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 08:41:12,456 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-20 08:41:12,456 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 08:41:12,456 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-20 08:41:12,457 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-20 08:41:12,458 INFO L87 Difference]: Start difference. First operand 102 states and 145 transitions. Second operand has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-11-20 08:41:12,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 08:41:12,493 INFO L93 Difference]: Finished difference Result 204 states and 291 transitions. [2024-11-20 08:41:12,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-20 08:41:12,496 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 109 [2024-11-20 08:41:12,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 08:41:12,498 INFO L225 Difference]: With dead ends: 204 [2024-11-20 08:41:12,498 INFO L226 Difference]: Without dead ends: 105 [2024-11-20 08:41:12,498 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-20 08:41:12,503 INFO L432 NwaCegarLoop]: 138 mSDtfsCounter, 1 mSDsluCounter, 268 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 406 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-20 08:41:12,503 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 406 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 08:41:12,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2024-11-20 08:41:12,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 104. [2024-11-20 08:41:12,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 89 states have (on average 1.3595505617977528) internal successors, (121), 89 states have internal predecessors, (121), 13 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-20 08:41:12,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 147 transitions. [2024-11-20 08:41:12,518 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 147 transitions. Word has length 109 [2024-11-20 08:41:12,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 08:41:12,518 INFO L471 AbstractCegarLoop]: Abstraction has 104 states and 147 transitions. [2024-11-20 08:41:12,520 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-11-20 08:41:12,520 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 147 transitions. [2024-11-20 08:41:12,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-11-20 08:41:12,521 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 08:41:12,522 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 08:41:12,522 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-20 08:41:12,525 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 08:41:12,526 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 08:41:12,526 INFO L85 PathProgramCache]: Analyzing trace with hash -1606098047, now seen corresponding path program 1 times [2024-11-20 08:41:12,526 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 08:41:12,526 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1131567435] [2024-11-20 08:41:12,526 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 08:41:12,526 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 08:41:12,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:41:14,557 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 08:41:14,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:41:14,563 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-20 08:41:14,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:41:14,568 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-20 08:41:14,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:41:14,574 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-20 08:41:14,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:41:14,590 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-20 08:41:14,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:41:14,595 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-20 08:41:14,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:41:14,599 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-20 08:41:14,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:41:14,603 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-20 08:41:14,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:41:14,607 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-20 08:41:14,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:41:14,610 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-20 08:41:14,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:41:14,614 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-20 08:41:14,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:41:14,617 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-20 08:41:14,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:41:14,621 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-20 08:41:14,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:41:14,626 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-11-20 08:41:14,627 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 08:41:14,627 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1131567435] [2024-11-20 08:41:14,627 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1131567435] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 08:41:14,627 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 08:41:14,628 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-20 08:41:14,628 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2073669034] [2024-11-20 08:41:14,629 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 08:41:14,629 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-20 08:41:14,630 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 08:41:14,630 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-20 08:41:14,632 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-11-20 08:41:14,633 INFO L87 Difference]: Start difference. First operand 104 states and 147 transitions. Second operand has 11 states, 10 states have (on average 4.7) internal successors, (47), 11 states have internal predecessors, (47), 3 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 2 states have call predecessors, (13), 3 states have call successors, (13) [2024-11-20 08:41:15,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 08:41:15,323 INFO L93 Difference]: Finished difference Result 270 states and 383 transitions. [2024-11-20 08:41:15,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-20 08:41:15,325 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 4.7) internal successors, (47), 11 states have internal predecessors, (47), 3 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 2 states have call predecessors, (13), 3 states have call successors, (13) Word has length 109 [2024-11-20 08:41:15,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 08:41:15,327 INFO L225 Difference]: With dead ends: 270 [2024-11-20 08:41:15,327 INFO L226 Difference]: Without dead ends: 169 [2024-11-20 08:41:15,328 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=63, Invalid=209, Unknown=0, NotChecked=0, Total=272 [2024-11-20 08:41:15,329 INFO L432 NwaCegarLoop]: 112 mSDtfsCounter, 290 mSDsluCounter, 649 mSDsCounter, 0 mSdLazyCounter, 379 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 291 SdHoareTripleChecker+Valid, 761 SdHoareTripleChecker+Invalid, 380 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 379 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-20 08:41:15,330 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [291 Valid, 761 Invalid, 380 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 379 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-20 08:41:15,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2024-11-20 08:41:15,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 115. [2024-11-20 08:41:15,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 100 states have (on average 1.37) internal successors, (137), 100 states have internal predecessors, (137), 13 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-20 08:41:15,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 163 transitions. [2024-11-20 08:41:15,345 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 163 transitions. Word has length 109 [2024-11-20 08:41:15,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 08:41:15,345 INFO L471 AbstractCegarLoop]: Abstraction has 115 states and 163 transitions. [2024-11-20 08:41:15,346 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 4.7) internal successors, (47), 11 states have internal predecessors, (47), 3 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 2 states have call predecessors, (13), 3 states have call successors, (13) [2024-11-20 08:41:15,346 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 163 transitions. [2024-11-20 08:41:15,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-11-20 08:41:15,348 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 08:41:15,349 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 08:41:15,349 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-20 08:41:15,350 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 08:41:15,350 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 08:41:15,350 INFO L85 PathProgramCache]: Analyzing trace with hash 1667800895, now seen corresponding path program 1 times [2024-11-20 08:41:15,351 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 08:41:15,351 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [676817175] [2024-11-20 08:41:15,353 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 08:41:15,353 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 08:41:15,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:41:15,798 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 08:41:15,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:41:15,802 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-20 08:41:15,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:41:15,805 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-20 08:41:15,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:41:15,808 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-20 08:41:15,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:41:15,813 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-20 08:41:15,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:41:15,817 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-20 08:41:15,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:41:15,820 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-20 08:41:15,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:41:15,823 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-20 08:41:15,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:41:15,826 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-20 08:41:15,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:41:15,829 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-20 08:41:15,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:41:15,833 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-20 08:41:15,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:41:15,837 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-20 08:41:15,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:41:15,840 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-20 08:41:15,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:41:15,844 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-11-20 08:41:15,844 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 08:41:15,844 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [676817175] [2024-11-20 08:41:15,844 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [676817175] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 08:41:15,845 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 08:41:15,845 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-20 08:41:15,845 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [263640395] [2024-11-20 08:41:15,845 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 08:41:15,846 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-20 08:41:15,846 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 08:41:15,847 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-20 08:41:15,847 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-20 08:41:15,847 INFO L87 Difference]: Start difference. First operand 115 states and 163 transitions. Second operand has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 7 states have internal predecessors, (47), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-11-20 08:41:16,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 08:41:16,112 INFO L93 Difference]: Finished difference Result 284 states and 403 transitions. [2024-11-20 08:41:16,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-20 08:41:16,112 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 7 states have internal predecessors, (47), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 109 [2024-11-20 08:41:16,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 08:41:16,114 INFO L225 Difference]: With dead ends: 284 [2024-11-20 08:41:16,114 INFO L226 Difference]: Without dead ends: 172 [2024-11-20 08:41:16,114 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-20 08:41:16,115 INFO L432 NwaCegarLoop]: 119 mSDtfsCounter, 184 mSDsluCounter, 364 mSDsCounter, 0 mSdLazyCounter, 224 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 184 SdHoareTripleChecker+Valid, 483 SdHoareTripleChecker+Invalid, 226 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 224 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-20 08:41:16,115 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [184 Valid, 483 Invalid, 226 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 224 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-20 08:41:16,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2024-11-20 08:41:16,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 124. [2024-11-20 08:41:16,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 109 states have (on average 1.3761467889908257) internal successors, (150), 109 states have internal predecessors, (150), 13 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-20 08:41:16,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 176 transitions. [2024-11-20 08:41:16,139 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 176 transitions. Word has length 109 [2024-11-20 08:41:16,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 08:41:16,139 INFO L471 AbstractCegarLoop]: Abstraction has 124 states and 176 transitions. [2024-11-20 08:41:16,139 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 7 states have internal predecessors, (47), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-11-20 08:41:16,139 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 176 transitions. [2024-11-20 08:41:16,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-11-20 08:41:16,140 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 08:41:16,140 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 08:41:16,140 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-20 08:41:16,141 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 08:41:16,141 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 08:41:16,141 INFO L85 PathProgramCache]: Analyzing trace with hash -1927988566, now seen corresponding path program 1 times [2024-11-20 08:41:16,141 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 08:41:16,142 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [305339381] [2024-11-20 08:41:16,142 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 08:41:16,142 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 08:41:16,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat