./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SFH_nondet_test3-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 4a390ef5 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/uthash-2.0.2/uthash_SFH_nondet_test3-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 6fd297418200393a9bb890e84311a80b6eacd7d5d7cdd65efb1397f8b8ab870f --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-24 14:57:16,721 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 14:57:16,803 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-24 14:57:16,808 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 14:57:16,810 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 14:57:16,831 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 14:57:16,833 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 14:57:16,833 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 14:57:16,833 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-24 14:57:16,834 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-24 14:57:16,835 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 14:57:16,835 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 14:57:16,835 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 14:57:16,835 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 14:57:16,836 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 14:57:16,837 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 14:57:16,837 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-24 14:57:16,837 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-24 14:57:16,837 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-24 14:57:16,838 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-24 14:57:16,838 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 14:57:16,840 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-24 14:57:16,841 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 14:57:16,841 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-24 14:57:16,841 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 14:57:16,841 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-24 14:57:16,841 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-24 14:57:16,841 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 14:57:16,842 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 14:57:16,842 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 14:57:16,842 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-24 14:57:16,842 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 14:57:16,842 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 14:57:16,842 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 14:57:16,842 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 14:57:16,843 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-24 14:57:16,843 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-24 14:57:16,843 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-24 14:57:16,843 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 14:57:16,843 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 14:57:16,843 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 14:57:16,844 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 14:57:16,844 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 -> 6fd297418200393a9bb890e84311a80b6eacd7d5d7cdd65efb1397f8b8ab870f [2024-10-24 14:57:17,040 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 14:57:17,061 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 14:57:17,063 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 14:57:17,065 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 14:57:17,065 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 14:57:17,066 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SFH_nondet_test3-1.i [2024-10-24 14:57:18,223 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 14:57:18,476 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 14:57:18,477 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SFH_nondet_test3-1.i [2024-10-24 14:57:18,494 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0cebe8e75/762b79647eac4049a0fe05d98b7842f5/FLAG2a25a4cce [2024-10-24 14:57:18,795 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0cebe8e75/762b79647eac4049a0fe05d98b7842f5 [2024-10-24 14:57:18,797 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 14:57:18,798 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 14:57:18,800 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 14:57:18,800 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 14:57:18,805 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 14:57:18,806 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 02:57:18" (1/1) ... [2024-10-24 14:57:18,806 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@46e87fa0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:57:18, skipping insertion in model container [2024-10-24 14:57:18,806 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 02:57:18" (1/1) ... [2024-10-24 14:57:18,849 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 14:57:19,166 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SFH_nondet_test3-1.i[33519,33532] [2024-10-24 14:57:19,249 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 14:57:19,259 INFO L200 MainTranslator]: Completed pre-run [2024-10-24 14:57:19,283 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SFH_nondet_test3-1.i[33519,33532] [2024-10-24 14:57:19,330 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 14:57:19,359 INFO L204 MainTranslator]: Completed translation [2024-10-24 14:57:19,360 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:57:19 WrapperNode [2024-10-24 14:57:19,360 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 14:57:19,361 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-24 14:57:19,361 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-24 14:57:19,361 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-24 14:57:19,365 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:57:19" (1/1) ... [2024-10-24 14:57:19,385 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:57:19" (1/1) ... [2024-10-24 14:57:19,444 INFO L138 Inliner]: procedures = 177, calls = 273, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 1431 [2024-10-24 14:57:19,445 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-24 14:57:19,445 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-24 14:57:19,445 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-24 14:57:19,446 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-24 14:57:19,455 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:57:19" (1/1) ... [2024-10-24 14:57:19,455 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:57:19" (1/1) ... [2024-10-24 14:57:19,462 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:57:19" (1/1) ... [2024-10-24 14:57:19,520 INFO L175 MemorySlicer]: Split 254 memory accesses to 3 slices as follows [2, 34, 218]. 86 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 54 writes are split as follows [0, 4, 50]. [2024-10-24 14:57:19,520 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:57:19" (1/1) ... [2024-10-24 14:57:19,520 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:57:19" (1/1) ... [2024-10-24 14:57:19,552 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:57:19" (1/1) ... [2024-10-24 14:57:19,569 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:57:19" (1/1) ... [2024-10-24 14:57:19,576 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:57:19" (1/1) ... [2024-10-24 14:57:19,581 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:57:19" (1/1) ... [2024-10-24 14:57:19,592 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-24 14:57:19,593 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-24 14:57:19,593 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-24 14:57:19,593 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-24 14:57:19,594 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:57:19" (1/1) ... [2024-10-24 14:57:19,623 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 14:57:19,631 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 14:57:19,646 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-24 14:57:19,647 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-24 14:57:19,690 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-10-24 14:57:19,691 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-10-24 14:57:19,691 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-10-24 14:57:19,691 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-10-24 14:57:19,691 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-10-24 14:57:19,691 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-10-24 14:57:19,692 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-10-24 14:57:19,692 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-10-24 14:57:19,692 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2024-10-24 14:57:19,692 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2024-10-24 14:57:19,692 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#2 [2024-10-24 14:57:19,692 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2024-10-24 14:57:19,692 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2024-10-24 14:57:19,692 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#2 [2024-10-24 14:57:19,692 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-10-24 14:57:19,692 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-24 14:57:19,692 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-10-24 14:57:19,692 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-10-24 14:57:19,692 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-10-24 14:57:19,692 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-10-24 14:57:19,692 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-10-24 14:57:19,692 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-10-24 14:57:19,693 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-10-24 14:57:19,693 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-24 14:57:19,693 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-24 14:57:19,693 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-24 14:57:19,693 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-10-24 14:57:19,693 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-24 14:57:19,693 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-24 14:57:19,856 INFO L238 CfgBuilder]: Building ICFG [2024-10-24 14:57:19,858 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-24 14:57:20,939 INFO L? ?]: Removed 313 outVars from TransFormulas that were not future-live. [2024-10-24 14:57:20,939 INFO L287 CfgBuilder]: Performing block encoding [2024-10-24 14:57:20,978 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-24 14:57:20,978 INFO L314 CfgBuilder]: Removed 63 assume(true) statements. [2024-10-24 14:57:20,978 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 02:57:20 BoogieIcfgContainer [2024-10-24 14:57:20,978 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-24 14:57:20,980 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-24 14:57:20,980 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-24 14:57:20,984 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-24 14:57:20,984 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 02:57:18" (1/3) ... [2024-10-24 14:57:20,984 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@57dc568c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 02:57:20, skipping insertion in model container [2024-10-24 14:57:20,984 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:57:19" (2/3) ... [2024-10-24 14:57:20,985 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@57dc568c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 02:57:20, skipping insertion in model container [2024-10-24 14:57:20,985 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 02:57:20" (3/3) ... [2024-10-24 14:57:20,986 INFO L112 eAbstractionObserver]: Analyzing ICFG uthash_SFH_nondet_test3-1.i [2024-10-24 14:57:20,997 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-24 14:57:20,997 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-24 14:57:21,054 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-24 14:57:21,059 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;@39fda46, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-24 14:57:21,059 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-24 14:57:21,063 INFO L276 IsEmpty]: Start isEmpty. Operand has 398 states, 389 states have (on average 1.6272493573264781) internal successors, (633), 391 states have internal predecessors, (633), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-10-24 14:57:21,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-10-24 14:57:21,068 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 14:57:21,068 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 14:57:21,069 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 14:57:21,072 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 14:57:21,072 INFO L85 PathProgramCache]: Analyzing trace with hash 1971132038, now seen corresponding path program 1 times [2024-10-24 14:57:21,078 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 14:57:21,078 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1987318877] [2024-10-24 14:57:21,078 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 14:57:21,079 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 14:57:21,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:57:21,220 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 14:57:21,221 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 14:57:21,221 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1987318877] [2024-10-24 14:57:21,221 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1987318877] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 14:57:21,222 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 14:57:21,222 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 14:57:21,223 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1669152878] [2024-10-24 14:57:21,223 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 14:57:21,226 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-24 14:57:21,227 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 14:57:21,243 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-24 14:57:21,244 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-24 14:57:21,247 INFO L87 Difference]: Start difference. First operand has 398 states, 389 states have (on average 1.6272493573264781) internal successors, (633), 391 states have internal predecessors, (633), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 14:57:21,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 14:57:21,309 INFO L93 Difference]: Finished difference Result 794 states and 1285 transitions. [2024-10-24 14:57:21,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-24 14:57:21,311 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2024-10-24 14:57:21,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 14:57:21,323 INFO L225 Difference]: With dead ends: 794 [2024-10-24 14:57:21,323 INFO L226 Difference]: Without dead ends: 395 [2024-10-24 14:57:21,328 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 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-10-24 14:57:21,330 INFO L432 NwaCegarLoop]: 571 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 571 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 14:57:21,331 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 571 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 14:57:21,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 395 states. [2024-10-24 14:57:21,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 395 to 395. [2024-10-24 14:57:21,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 395 states, 387 states have (on average 1.449612403100775) internal successors, (561), 388 states have internal predecessors, (561), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-10-24 14:57:21,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 395 states to 395 states and 571 transitions. [2024-10-24 14:57:21,379 INFO L78 Accepts]: Start accepts. Automaton has 395 states and 571 transitions. Word has length 11 [2024-10-24 14:57:21,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 14:57:21,379 INFO L471 AbstractCegarLoop]: Abstraction has 395 states and 571 transitions. [2024-10-24 14:57:21,379 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 14:57:21,379 INFO L276 IsEmpty]: Start isEmpty. Operand 395 states and 571 transitions. [2024-10-24 14:57:21,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-10-24 14:57:21,380 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 14:57:21,380 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 14:57:21,380 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-24 14:57:21,380 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 14:57:21,381 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 14:57:21,381 INFO L85 PathProgramCache]: Analyzing trace with hash 1788751725, now seen corresponding path program 1 times [2024-10-24 14:57:21,381 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 14:57:21,381 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [839921220] [2024-10-24 14:57:21,381 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 14:57:21,382 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 14:57:21,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:57:21,605 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 14:57:21,606 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 14:57:21,606 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [839921220] [2024-10-24 14:57:21,606 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [839921220] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 14:57:21,606 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 14:57:21,606 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 14:57:21,607 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [616239804] [2024-10-24 14:57:21,607 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 14:57:21,608 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 14:57:21,608 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 14:57:21,608 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 14:57:21,609 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 14:57:21,609 INFO L87 Difference]: Start difference. First operand 395 states and 571 transitions. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 14:57:21,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 14:57:21,815 INFO L93 Difference]: Finished difference Result 1084 states and 1584 transitions. [2024-10-24 14:57:21,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 14:57:21,816 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2024-10-24 14:57:21,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 14:57:21,820 INFO L225 Difference]: With dead ends: 1084 [2024-10-24 14:57:21,823 INFO L226 Difference]: Without dead ends: 689 [2024-10-24 14:57:21,823 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 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-10-24 14:57:21,824 INFO L432 NwaCegarLoop]: 557 mSDtfsCounter, 430 mSDsluCounter, 1070 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 431 SdHoareTripleChecker+Valid, 1627 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 14:57:21,825 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [431 Valid, 1627 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 14:57:21,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 689 states. [2024-10-24 14:57:21,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 689 to 688. [2024-10-24 14:57:21,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 688 states, 679 states have (on average 1.4683357879234167) internal successors, (997), 681 states have internal predecessors, (997), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-10-24 14:57:21,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 688 states to 688 states and 1009 transitions. [2024-10-24 14:57:21,856 INFO L78 Accepts]: Start accepts. Automaton has 688 states and 1009 transitions. Word has length 13 [2024-10-24 14:57:21,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 14:57:21,857 INFO L471 AbstractCegarLoop]: Abstraction has 688 states and 1009 transitions. [2024-10-24 14:57:21,857 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 14:57:21,857 INFO L276 IsEmpty]: Start isEmpty. Operand 688 states and 1009 transitions. [2024-10-24 14:57:21,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2024-10-24 14:57:21,859 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 14:57:21,859 INFO L215 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] [2024-10-24 14:57:21,859 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-24 14:57:21,859 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 14:57:21,860 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 14:57:21,860 INFO L85 PathProgramCache]: Analyzing trace with hash 1712818238, now seen corresponding path program 1 times [2024-10-24 14:57:21,860 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 14:57:21,860 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1456107717] [2024-10-24 14:57:21,860 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 14:57:21,860 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 14:57:21,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:57:22,013 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 14:57:22,014 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 14:57:22,014 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1456107717] [2024-10-24 14:57:22,015 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1456107717] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 14:57:22,015 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 14:57:22,015 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 14:57:22,017 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [610345516] [2024-10-24 14:57:22,017 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 14:57:22,017 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 14:57:22,017 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 14:57:22,018 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 14:57:22,018 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 14:57:22,018 INFO L87 Difference]: Start difference. First operand 688 states and 1009 transitions. Second operand has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 14:57:22,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 14:57:22,093 INFO L93 Difference]: Finished difference Result 959 states and 1398 transitions. [2024-10-24 14:57:22,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 14:57:22,094 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 67 [2024-10-24 14:57:22,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 14:57:22,096 INFO L225 Difference]: With dead ends: 959 [2024-10-24 14:57:22,096 INFO L226 Difference]: Without dead ends: 604 [2024-10-24 14:57:22,097 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-24 14:57:22,097 INFO L432 NwaCegarLoop]: 466 mSDtfsCounter, 30 mSDsluCounter, 915 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 1381 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 14:57:22,098 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 1381 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 14:57:22,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 604 states. [2024-10-24 14:57:22,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 604 to 604. [2024-10-24 14:57:22,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 604 states, 595 states have (on average 1.4168067226890757) internal successors, (843), 597 states have internal predecessors, (843), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-10-24 14:57:22,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 604 states to 604 states and 855 transitions. [2024-10-24 14:57:22,109 INFO L78 Accepts]: Start accepts. Automaton has 604 states and 855 transitions. Word has length 67 [2024-10-24 14:57:22,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 14:57:22,110 INFO L471 AbstractCegarLoop]: Abstraction has 604 states and 855 transitions. [2024-10-24 14:57:22,110 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 14:57:22,110 INFO L276 IsEmpty]: Start isEmpty. Operand 604 states and 855 transitions. [2024-10-24 14:57:22,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2024-10-24 14:57:22,112 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 14:57:22,112 INFO L215 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] [2024-10-24 14:57:22,112 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-24 14:57:22,112 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 14:57:22,113 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 14:57:22,113 INFO L85 PathProgramCache]: Analyzing trace with hash 1157922890, now seen corresponding path program 1 times [2024-10-24 14:57:22,113 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 14:57:22,113 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1341579145] [2024-10-24 14:57:22,113 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 14:57:22,113 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 14:57:22,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:57:22,477 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 14:57:22,477 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 14:57:22,477 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1341579145] [2024-10-24 14:57:22,477 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1341579145] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 14:57:22,477 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 14:57:22,477 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-24 14:57:22,477 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1611891826] [2024-10-24 14:57:22,478 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 14:57:22,478 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-24 14:57:22,478 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 14:57:22,478 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-24 14:57:22,478 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-10-24 14:57:22,479 INFO L87 Difference]: Start difference. First operand 604 states and 855 transitions. Second operand has 7 states, 7 states have (on average 9.428571428571429) internal successors, (66), 7 states have internal predecessors, (66), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 14:57:22,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 14:57:22,586 INFO L93 Difference]: Finished difference Result 1117 states and 1550 transitions. [2024-10-24 14:57:22,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-24 14:57:22,587 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.428571428571429) internal successors, (66), 7 states have internal predecessors, (66), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 67 [2024-10-24 14:57:22,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 14:57:22,590 INFO L225 Difference]: With dead ends: 1117 [2024-10-24 14:57:22,590 INFO L226 Difference]: Without dead ends: 843 [2024-10-24 14:57:22,592 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-10-24 14:57:22,593 INFO L432 NwaCegarLoop]: 516 mSDtfsCounter, 462 mSDsluCounter, 1498 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 467 SdHoareTripleChecker+Valid, 2014 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 14:57:22,594 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [467 Valid, 2014 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 14:57:22,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 843 states. [2024-10-24 14:57:22,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 843 to 603. [2024-10-24 14:57:22,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 603 states, 594 states have (on average 1.4158249158249159) internal successors, (841), 596 states have internal predecessors, (841), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-10-24 14:57:22,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 603 states to 603 states and 853 transitions. [2024-10-24 14:57:22,610 INFO L78 Accepts]: Start accepts. Automaton has 603 states and 853 transitions. Word has length 67 [2024-10-24 14:57:22,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 14:57:22,610 INFO L471 AbstractCegarLoop]: Abstraction has 603 states and 853 transitions. [2024-10-24 14:57:22,610 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.428571428571429) internal successors, (66), 7 states have internal predecessors, (66), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 14:57:22,610 INFO L276 IsEmpty]: Start isEmpty. Operand 603 states and 853 transitions. [2024-10-24 14:57:22,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-10-24 14:57:22,614 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 14:57:22,614 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 14:57:22,615 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-24 14:57:22,615 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 14:57:22,615 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 14:57:22,615 INFO L85 PathProgramCache]: Analyzing trace with hash -1353216415, now seen corresponding path program 1 times [2024-10-24 14:57:22,615 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 14:57:22,615 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1337751225] [2024-10-24 14:57:22,616 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 14:57:22,616 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 14:57:22,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:57:22,792 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-10-24 14:57:22,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:57:22,795 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-10-24 14:57:22,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:57:22,801 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-24 14:57:22,801 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 14:57:22,801 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1337751225] [2024-10-24 14:57:22,801 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1337751225] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 14:57:22,802 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 14:57:22,802 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-24 14:57:22,802 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [180158754] [2024-10-24 14:57:22,802 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 14:57:22,802 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 14:57:22,802 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 14:57:22,803 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 14:57:22,803 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-24 14:57:22,803 INFO L87 Difference]: Start difference. First operand 603 states and 853 transitions. Second operand has 5 states, 5 states have (on average 19.0) internal successors, (95), 4 states have internal predecessors, (95), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-24 14:57:23,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 14:57:23,029 INFO L93 Difference]: Finished difference Result 1154 states and 1628 transitions. [2024-10-24 14:57:23,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 14:57:23,030 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 19.0) internal successors, (95), 4 states have internal predecessors, (95), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 102 [2024-10-24 14:57:23,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 14:57:23,033 INFO L225 Difference]: With dead ends: 1154 [2024-10-24 14:57:23,033 INFO L226 Difference]: Without dead ends: 611 [2024-10-24 14:57:23,034 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-24 14:57:23,035 INFO L432 NwaCegarLoop]: 451 mSDtfsCounter, 112 mSDsluCounter, 1182 mSDsCounter, 0 mSdLazyCounter, 172 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 1633 SdHoareTripleChecker+Invalid, 193 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 172 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-24 14:57:23,037 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [112 Valid, 1633 Invalid, 193 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 172 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-24 14:57:23,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 611 states. [2024-10-24 14:57:23,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 611 to 603. [2024-10-24 14:57:23,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 603 states, 594 states have (on average 1.3922558922558923) internal successors, (827), 596 states have internal predecessors, (827), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-10-24 14:57:23,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 603 states to 603 states and 839 transitions. [2024-10-24 14:57:23,050 INFO L78 Accepts]: Start accepts. Automaton has 603 states and 839 transitions. Word has length 102 [2024-10-24 14:57:23,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 14:57:23,051 INFO L471 AbstractCegarLoop]: Abstraction has 603 states and 839 transitions. [2024-10-24 14:57:23,051 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.0) internal successors, (95), 4 states have internal predecessors, (95), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-24 14:57:23,051 INFO L276 IsEmpty]: Start isEmpty. Operand 603 states and 839 transitions. [2024-10-24 14:57:23,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-10-24 14:57:23,053 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 14:57:23,053 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 14:57:23,053 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-24 14:57:23,054 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 14:57:23,055 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 14:57:23,055 INFO L85 PathProgramCache]: Analyzing trace with hash 151416941, now seen corresponding path program 1 times [2024-10-24 14:57:23,055 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 14:57:23,055 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [618992030] [2024-10-24 14:57:23,055 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 14:57:23,055 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 14:57:23,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:57:23,192 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-10-24 14:57:23,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:57:23,195 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-10-24 14:57:23,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:57:23,206 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-24 14:57:23,207 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 14:57:23,207 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [618992030] [2024-10-24 14:57:23,207 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [618992030] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 14:57:23,207 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 14:57:23,207 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 14:57:23,207 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [426858486] [2024-10-24 14:57:23,207 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 14:57:23,208 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 14:57:23,208 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 14:57:23,208 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 14:57:23,208 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 14:57:23,209 INFO L87 Difference]: Start difference. First operand 603 states and 839 transitions. Second operand has 4 states, 4 states have (on average 23.75) internal successors, (95), 3 states have internal predecessors, (95), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-24 14:57:23,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 14:57:23,398 INFO L93 Difference]: Finished difference Result 1144 states and 1595 transitions. [2024-10-24 14:57:23,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 14:57:23,399 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 23.75) internal successors, (95), 3 states have internal predecessors, (95), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 102 [2024-10-24 14:57:23,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 14:57:23,401 INFO L225 Difference]: With dead ends: 1144 [2024-10-24 14:57:23,401 INFO L226 Difference]: Without dead ends: 617 [2024-10-24 14:57:23,402 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 6 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-10-24 14:57:23,402 INFO L432 NwaCegarLoop]: 466 mSDtfsCounter, 8 mSDsluCounter, 835 mSDsCounter, 0 mSdLazyCounter, 128 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 1301 SdHoareTripleChecker+Invalid, 139 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 128 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-24 14:57:23,402 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 1301 Invalid, 139 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 128 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-24 14:57:23,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 617 states. [2024-10-24 14:57:23,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 617 to 615. [2024-10-24 14:57:23,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 615 states, 606 states have (on average 1.3844884488448845) internal successors, (839), 608 states have internal predecessors, (839), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-10-24 14:57:23,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 615 states to 615 states and 851 transitions. [2024-10-24 14:57:23,413 INFO L78 Accepts]: Start accepts. Automaton has 615 states and 851 transitions. Word has length 102 [2024-10-24 14:57:23,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 14:57:23,413 INFO L471 AbstractCegarLoop]: Abstraction has 615 states and 851 transitions. [2024-10-24 14:57:23,413 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 23.75) internal successors, (95), 3 states have internal predecessors, (95), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-24 14:57:23,413 INFO L276 IsEmpty]: Start isEmpty. Operand 615 states and 851 transitions. [2024-10-24 14:57:23,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-10-24 14:57:23,414 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 14:57:23,414 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 14:57:23,414 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-24 14:57:23,415 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 14:57:23,415 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 14:57:23,415 INFO L85 PathProgramCache]: Analyzing trace with hash 1118767595, now seen corresponding path program 1 times [2024-10-24 14:57:23,415 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 14:57:23,415 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [744274307] [2024-10-24 14:57:23,415 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 14:57:23,415 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 14:57:23,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:57:23,773 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-10-24 14:57:23,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:57:23,794 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-10-24 14:57:23,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:57:23,797 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-24 14:57:23,797 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 14:57:23,797 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [744274307] [2024-10-24 14:57:23,797 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [744274307] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 14:57:23,797 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1458861639] [2024-10-24 14:57:23,798 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 14:57:23,798 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 14:57:23,798 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 14:57:23,800 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-24 14:57:23,801 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-24 14:57:24,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:57:24,052 INFO L255 TraceCheckSpWp]: Trace formula consists of 598 conjuncts, 35 conjuncts are in the unsatisfiable core [2024-10-24 14:57:24,059 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 14:57:24,091 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-10-24 14:57:24,126 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 15 [2024-10-24 14:57:24,960 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-24 14:57:24,961 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 14:57:24,961 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1458861639] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 14:57:24,961 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-24 14:57:24,961 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [5] total 15 [2024-10-24 14:57:24,961 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [219787300] [2024-10-24 14:57:24,962 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 14:57:24,962 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-24 14:57:24,962 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 14:57:24,962 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-24 14:57:24,963 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2024-10-24 14:57:24,963 INFO L87 Difference]: Start difference. First operand 615 states and 851 transitions. Second operand has 12 states, 12 states have (on average 7.916666666666667) internal successors, (95), 12 states have internal predecessors, (95), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-24 14:57:26,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 14:57:26,671 INFO L93 Difference]: Finished difference Result 1415 states and 1946 transitions. [2024-10-24 14:57:26,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-24 14:57:26,671 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 7.916666666666667) internal successors, (95), 12 states have internal predecessors, (95), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 102 [2024-10-24 14:57:26,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 14:57:26,674 INFO L225 Difference]: With dead ends: 1415 [2024-10-24 14:57:26,675 INFO L226 Difference]: Without dead ends: 892 [2024-10-24 14:57:26,676 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 95 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=112, Invalid=394, Unknown=0, NotChecked=0, Total=506 [2024-10-24 14:57:26,676 INFO L432 NwaCegarLoop]: 433 mSDtfsCounter, 722 mSDsluCounter, 2416 mSDsCounter, 0 mSdLazyCounter, 1037 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 726 SdHoareTripleChecker+Valid, 2849 SdHoareTripleChecker+Invalid, 1042 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 1037 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-10-24 14:57:26,677 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [726 Valid, 2849 Invalid, 1042 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 1037 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-10-24 14:57:26,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 892 states. [2024-10-24 14:57:26,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 892 to 647. [2024-10-24 14:57:26,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 647 states, 638 states have (on average 1.3730407523510972) internal successors, (876), 640 states have internal predecessors, (876), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-10-24 14:57:26,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 647 states to 647 states and 888 transitions. [2024-10-24 14:57:26,690 INFO L78 Accepts]: Start accepts. Automaton has 647 states and 888 transitions. Word has length 102 [2024-10-24 14:57:26,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 14:57:26,690 INFO L471 AbstractCegarLoop]: Abstraction has 647 states and 888 transitions. [2024-10-24 14:57:26,691 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 7.916666666666667) internal successors, (95), 12 states have internal predecessors, (95), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-24 14:57:26,691 INFO L276 IsEmpty]: Start isEmpty. Operand 647 states and 888 transitions. [2024-10-24 14:57:26,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-10-24 14:57:26,691 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 14:57:26,692 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 14:57:26,706 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-24 14:57:26,895 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 14:57:26,896 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 14:57:26,896 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 14:57:26,896 INFO L85 PathProgramCache]: Analyzing trace with hash -1693574746, now seen corresponding path program 1 times [2024-10-24 14:57:26,896 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 14:57:26,896 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [193154537] [2024-10-24 14:57:26,896 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 14:57:26,897 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 14:57:27,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:57:27,186 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-10-24 14:57:27,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:57:27,210 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-24 14:57:27,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:57:27,213 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-24 14:57:27,213 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 14:57:27,214 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [193154537] [2024-10-24 14:57:27,214 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [193154537] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 14:57:27,215 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2081134396] [2024-10-24 14:57:27,215 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 14:57:27,215 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 14:57:27,216 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 14:57:27,217 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-24 14:57:27,218 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-24 14:57:27,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:57:27,459 INFO L255 TraceCheckSpWp]: Trace formula consists of 599 conjuncts, 32 conjuncts are in the unsatisfiable core [2024-10-24 14:57:27,465 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 14:57:51,940 WARN L286 SmtUtils]: Spent 8.23s on a formula simplification that was a NOOP. DAG size: 31 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-10-24 14:58:42,455 WARN L286 SmtUtils]: Spent 7.30s on a formula simplification. DAG size of input: 30 DAG size of output: 1 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)