./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_test1-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SFH_nondet_test1-1.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/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 fdc85b042221b41aa26e62667e19ce1f6c246be9a2cb4f81fe8b15c8429db160 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 16:39:21,101 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 16:39:21,159 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-11 16:39:21,164 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 16:39:21,164 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 16:39:21,188 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 16:39:21,189 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 16:39:21,190 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 16:39:21,190 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 16:39:21,191 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 16:39:21,191 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 16:39:21,192 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 16:39:21,192 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 16:39:21,193 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 16:39:21,193 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 16:39:21,197 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 16:39:21,197 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 16:39:21,197 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 16:39:21,197 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 16:39:21,197 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 16:39:21,198 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 16:39:21,198 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 16:39:21,198 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 16:39:21,198 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 16:39:21,198 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 16:39:21,198 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 16:39:21,199 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 16:39:21,199 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 16:39:21,199 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 16:39:21,199 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 16:39:21,199 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 16:39:21,199 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 16:39:21,199 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 16:39:21,200 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 16:39:21,200 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 16:39:21,200 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 16:39:21,200 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 16:39:21,200 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 16:39:21,200 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 16:39:21,200 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 16:39:21,201 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 16:39:21,203 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 16:39:21,203 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-clean/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-clean/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 -> fdc85b042221b41aa26e62667e19ce1f6c246be9a2cb4f81fe8b15c8429db160 [2024-10-11 16:39:21,388 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 16:39:21,414 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 16:39:21,418 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 16:39:21,419 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 16:39:21,420 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 16:39:21,421 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SFH_nondet_test1-1.i [2024-10-11 16:39:22,697 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 16:39:22,906 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 16:39:22,907 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SFH_nondet_test1-1.i [2024-10-11 16:39:22,923 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/3e08ad184/7bf0b166ea4e4bdc9f66d776fa124715/FLAG7a17779a6 [2024-10-11 16:39:22,935 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/3e08ad184/7bf0b166ea4e4bdc9f66d776fa124715 [2024-10-11 16:39:22,937 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 16:39:22,938 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 16:39:22,939 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 16:39:22,940 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 16:39:22,945 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 16:39:22,946 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 04:39:22" (1/1) ... [2024-10-11 16:39:22,946 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@444a6429 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:39:22, skipping insertion in model container [2024-10-11 16:39:22,946 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 04:39:22" (1/1) ... [2024-10-11 16:39:22,982 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 16:39:23,257 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_test1-1.i[33519,33532] [2024-10-11 16:39:23,330 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 16:39:23,340 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 16:39:23,381 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_test1-1.i[33519,33532] [2024-10-11 16:39:23,415 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 16:39:23,455 INFO L204 MainTranslator]: Completed translation [2024-10-11 16:39:23,455 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:39:23 WrapperNode [2024-10-11 16:39:23,455 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 16:39:23,456 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 16:39:23,456 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 16:39:23,456 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 16:39:23,461 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:39:23" (1/1) ... [2024-10-11 16:39:23,479 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:39:23" (1/1) ... [2024-10-11 16:39:23,529 INFO L138 Inliner]: procedures = 176, calls = 169, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 797 [2024-10-11 16:39:23,529 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 16:39:23,529 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 16:39:23,529 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 16:39:23,530 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 16:39:23,539 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:39:23" (1/1) ... [2024-10-11 16:39:23,539 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:39:23" (1/1) ... [2024-10-11 16:39:23,545 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:39:23" (1/1) ... [2024-10-11 16:39:23,584 INFO L175 MemorySlicer]: Split 158 memory accesses to 2 slices as follows [2, 156]. 99 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 42 writes are split as follows [0, 42]. [2024-10-11 16:39:23,587 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:39:23" (1/1) ... [2024-10-11 16:39:23,588 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:39:23" (1/1) ... [2024-10-11 16:39:23,614 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:39:23" (1/1) ... [2024-10-11 16:39:23,622 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:39:23" (1/1) ... [2024-10-11 16:39:23,629 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:39:23" (1/1) ... [2024-10-11 16:39:23,636 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:39:23" (1/1) ... [2024-10-11 16:39:23,643 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 16:39:23,644 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 16:39:23,644 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 16:39:23,644 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 16:39:23,644 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:39:23" (1/1) ... [2024-10-11 16:39:23,652 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 16:39:23,663 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 16:39:23,675 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 16:39:23,677 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 16:39:23,710 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-10-11 16:39:23,711 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-10-11 16:39:23,711 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-10-11 16:39:23,711 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-10-11 16:39:23,711 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2024-10-11 16:39:23,711 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2024-10-11 16:39:23,712 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2024-10-11 16:39:23,712 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2024-10-11 16:39:23,713 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-10-11 16:39:23,713 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 16:39:23,713 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-10-11 16:39:23,713 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-10-11 16:39:23,713 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-10-11 16:39:23,713 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-10-11 16:39:23,714 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-11 16:39:23,714 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 16:39:23,714 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-11 16:39:23,714 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 16:39:23,714 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 16:39:23,866 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 16:39:23,868 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 16:39:24,585 INFO L? ?]: Removed 194 outVars from TransFormulas that were not future-live. [2024-10-11 16:39:24,585 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 16:39:24,607 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 16:39:24,607 INFO L314 CfgBuilder]: Removed 31 assume(true) statements. [2024-10-11 16:39:24,608 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 04:39:24 BoogieIcfgContainer [2024-10-11 16:39:24,608 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 16:39:24,610 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 16:39:24,610 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 16:39:24,612 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 16:39:24,612 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 04:39:22" (1/3) ... [2024-10-11 16:39:24,613 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@37589ac3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 04:39:24, skipping insertion in model container [2024-10-11 16:39:24,613 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:39:23" (2/3) ... [2024-10-11 16:39:24,613 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@37589ac3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 04:39:24, skipping insertion in model container [2024-10-11 16:39:24,613 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 04:39:24" (3/3) ... [2024-10-11 16:39:24,614 INFO L112 eAbstractionObserver]: Analyzing ICFG uthash_SFH_nondet_test1-1.i [2024-10-11 16:39:24,627 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 16:39:24,627 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 16:39:24,685 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 16:39:24,690 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;@dd6811f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 16:39:24,692 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 16:39:24,700 INFO L276 IsEmpty]: Start isEmpty. Operand has 206 states, 200 states have (on average 1.62) internal successors, (324), 201 states have internal predecessors, (324), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-11 16:39:24,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-10-11 16:39:24,705 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 16:39:24,706 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-10-11 16:39:24,706 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 16:39:24,709 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 16:39:24,710 INFO L85 PathProgramCache]: Analyzing trace with hash -1125032957, now seen corresponding path program 1 times [2024-10-11 16:39:24,716 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 16:39:24,716 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [670912688] [2024-10-11 16:39:24,716 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 16:39:24,717 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 16:39:24,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:39:24,821 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-11 16:39:24,822 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 16:39:24,822 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [670912688] [2024-10-11 16:39:24,823 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [670912688] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 16:39:24,823 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 16:39:24,823 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 16:39:24,824 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [337783757] [2024-10-11 16:39:24,826 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 16:39:24,829 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 16:39:24,829 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 16:39:24,845 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 16:39:24,845 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 16:39:24,849 INFO L87 Difference]: Start difference. First operand has 206 states, 200 states have (on average 1.62) internal successors, (324), 201 states have internal predecessors, (324), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 16:39:24,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 16:39:24,887 INFO L93 Difference]: Finished difference Result 411 states and 659 transitions. [2024-10-11 16:39:24,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 16:39:24,889 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2024-10-11 16:39:24,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 16:39:24,895 INFO L225 Difference]: With dead ends: 411 [2024-10-11 16:39:24,895 INFO L226 Difference]: Without dead ends: 204 [2024-10-11 16:39:24,898 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-11 16:39:24,901 INFO L432 NwaCegarLoop]: 290 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, 290 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-11 16:39:24,902 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 290 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 16:39:24,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2024-10-11 16:39:24,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 204. [2024-10-11 16:39:24,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 204 states, 199 states have (on average 1.4371859296482412) internal successors, (286), 199 states have internal predecessors, (286), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-11 16:39:24,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 292 transitions. [2024-10-11 16:39:24,949 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 292 transitions. Word has length 7 [2024-10-11 16:39:24,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 16:39:24,949 INFO L471 AbstractCegarLoop]: Abstraction has 204 states and 292 transitions. [2024-10-11 16:39:24,949 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 16:39:24,949 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 292 transitions. [2024-10-11 16:39:24,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-10-11 16:39:24,950 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 16:39:24,950 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-10-11 16:39:24,951 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 16:39:24,951 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 16:39:24,951 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 16:39:24,952 INFO L85 PathProgramCache]: Analyzing trace with hash -692801208, now seen corresponding path program 1 times [2024-10-11 16:39:24,952 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 16:39:24,952 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [515846484] [2024-10-11 16:39:24,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 16:39:24,953 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 16:39:24,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:39:25,005 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-11 16:39:25,005 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 16:39:25,005 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [515846484] [2024-10-11 16:39:25,005 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [515846484] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 16:39:25,005 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 16:39:25,005 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 16:39:25,005 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1698979943] [2024-10-11 16:39:25,006 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 16:39:25,006 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 16:39:25,006 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 16:39:25,007 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 16:39:25,007 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 16:39:25,007 INFO L87 Difference]: Start difference. First operand 204 states and 292 transitions. Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 16:39:25,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 16:39:25,059 INFO L93 Difference]: Finished difference Result 404 states and 580 transitions. [2024-10-11 16:39:25,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 16:39:25,059 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2024-10-11 16:39:25,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 16:39:25,061 INFO L225 Difference]: With dead ends: 404 [2024-10-11 16:39:25,061 INFO L226 Difference]: Without dead ends: 398 [2024-10-11 16:39:25,062 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 16:39:25,065 INFO L432 NwaCegarLoop]: 329 mSDtfsCounter, 274 mSDsluCounter, 285 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 277 SdHoareTripleChecker+Valid, 614 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 16:39:25,066 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [277 Valid, 614 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 16:39:25,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 398 states. [2024-10-11 16:39:25,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 398 to 205. [2024-10-11 16:39:25,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 205 states, 200 states have (on average 1.435) internal successors, (287), 200 states have internal predecessors, (287), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-11 16:39:25,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 293 transitions. [2024-10-11 16:39:25,085 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 293 transitions. Word has length 7 [2024-10-11 16:39:25,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 16:39:25,085 INFO L471 AbstractCegarLoop]: Abstraction has 205 states and 293 transitions. [2024-10-11 16:39:25,086 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 16:39:25,086 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 293 transitions. [2024-10-11 16:39:25,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2024-10-11 16:39:25,089 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 16:39:25,089 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 16:39:25,089 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 16:39:25,089 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 16:39:25,090 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 16:39:25,090 INFO L85 PathProgramCache]: Analyzing trace with hash 1078552354, now seen corresponding path program 1 times [2024-10-11 16:39:25,090 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 16:39:25,091 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [917180881] [2024-10-11 16:39:25,091 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 16:39:25,091 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 16:39:25,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:39:25,489 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 16:39:25,491 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 16:39:25,492 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [917180881] [2024-10-11 16:39:25,493 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [917180881] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 16:39:25,493 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 16:39:25,493 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 16:39:25,493 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1760616795] [2024-10-11 16:39:25,493 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 16:39:25,494 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 16:39:25,495 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 16:39:25,495 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 16:39:25,496 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 16:39:25,496 INFO L87 Difference]: Start difference. First operand 205 states and 293 transitions. Second operand has 4 states, 4 states have (on average 20.5) internal successors, (82), 4 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 16:39:25,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 16:39:25,659 INFO L93 Difference]: Finished difference Result 411 states and 587 transitions. [2024-10-11 16:39:25,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 16:39:25,663 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 20.5) internal successors, (82), 4 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 82 [2024-10-11 16:39:25,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 16:39:25,664 INFO L225 Difference]: With dead ends: 411 [2024-10-11 16:39:25,665 INFO L226 Difference]: Without dead ends: 208 [2024-10-11 16:39:25,665 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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-11 16:39:25,666 INFO L432 NwaCegarLoop]: 261 mSDtfsCounter, 105 mSDsluCounter, 431 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 692 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 16:39:25,666 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 692 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 16:39:25,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2024-10-11 16:39:25,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 205. [2024-10-11 16:39:25,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 205 states, 200 states have (on average 1.4) internal successors, (280), 200 states have internal predecessors, (280), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-11 16:39:25,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 286 transitions. [2024-10-11 16:39:25,681 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 286 transitions. Word has length 82 [2024-10-11 16:39:25,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 16:39:25,681 INFO L471 AbstractCegarLoop]: Abstraction has 205 states and 286 transitions. [2024-10-11 16:39:25,682 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.5) internal successors, (82), 4 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 16:39:25,682 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 286 transitions. [2024-10-11 16:39:25,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2024-10-11 16:39:25,683 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 16:39:25,684 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 16:39:25,684 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 16:39:25,684 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 16:39:25,685 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 16:39:25,685 INFO L85 PathProgramCache]: Analyzing trace with hash 1061741358, now seen corresponding path program 1 times [2024-10-11 16:39:25,688 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 16:39:25,688 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [801194701] [2024-10-11 16:39:25,688 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 16:39:25,688 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 16:39:25,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:39:25,942 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 16:39:25,943 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 16:39:25,943 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [801194701] [2024-10-11 16:39:25,943 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [801194701] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 16:39:25,943 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 16:39:25,944 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 16:39:25,944 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1407804744] [2024-10-11 16:39:25,944 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 16:39:25,945 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 16:39:25,945 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 16:39:25,945 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 16:39:25,946 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 16:39:25,946 INFO L87 Difference]: Start difference. First operand 205 states and 286 transitions. Second operand has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 2 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 16:39:25,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 16:39:25,986 INFO L93 Difference]: Finished difference Result 537 states and 759 transitions. [2024-10-11 16:39:25,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 16:39:25,987 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 2 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 82 [2024-10-11 16:39:25,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 16:39:25,989 INFO L225 Difference]: With dead ends: 537 [2024-10-11 16:39:25,989 INFO L226 Difference]: Without dead ends: 334 [2024-10-11 16:39:25,990 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 16:39:25,991 INFO L432 NwaCegarLoop]: 281 mSDtfsCounter, 134 mSDsluCounter, 274 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 555 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 16:39:25,994 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [134 Valid, 555 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 16:39:25,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 334 states. [2024-10-11 16:39:26,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 334 to 334. [2024-10-11 16:39:26,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 334 states, 329 states have (on average 1.4224924012158056) internal successors, (468), 329 states have internal predecessors, (468), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-11 16:39:26,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 334 states to 334 states and 474 transitions. [2024-10-11 16:39:26,015 INFO L78 Accepts]: Start accepts. Automaton has 334 states and 474 transitions. Word has length 82 [2024-10-11 16:39:26,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 16:39:26,016 INFO L471 AbstractCegarLoop]: Abstraction has 334 states and 474 transitions. [2024-10-11 16:39:26,016 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 2 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 16:39:26,017 INFO L276 IsEmpty]: Start isEmpty. Operand 334 states and 474 transitions. [2024-10-11 16:39:26,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2024-10-11 16:39:26,021 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 16:39:26,021 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-11 16:39:26,022 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 16:39:26,022 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 16:39:26,022 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 16:39:26,022 INFO L85 PathProgramCache]: Analyzing trace with hash -1601131103, now seen corresponding path program 1 times [2024-10-11 16:39:26,022 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 16:39:26,023 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1024736987] [2024-10-11 16:39:26,023 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 16:39:26,023 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 16:39:26,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:39:26,252 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-11 16:39:26,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:39:26,260 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-11 16:39:26,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:39:26,267 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-11 16:39:26,268 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 16:39:26,269 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1024736987] [2024-10-11 16:39:26,269 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1024736987] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 16:39:26,269 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1697346584] [2024-10-11 16:39:26,269 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 16:39:26,270 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 16:39:26,270 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 16:39:26,275 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 16:39:26,277 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-11 16:39:26,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:39:26,530 INFO L255 TraceCheckSpWp]: Trace formula consists of 551 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-11 16:39:26,539 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 16:39:26,683 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-11 16:39:26,683 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 16:39:26,788 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-11 16:39:26,788 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1697346584] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 16:39:26,788 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 16:39:26,789 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 7 [2024-10-11 16:39:26,789 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1202834815] [2024-10-11 16:39:26,789 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 16:39:26,789 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 16:39:26,790 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 16:39:26,790 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 16:39:26,791 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-11 16:39:26,791 INFO L87 Difference]: Start difference. First operand 334 states and 474 transitions. Second operand has 7 states, 7 states have (on average 24.571428571428573) internal successors, (172), 6 states have internal predecessors, (172), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-11 16:39:26,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 16:39:26,999 INFO L93 Difference]: Finished difference Result 793 states and 1128 transitions. [2024-10-11 16:39:26,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 16:39:26,999 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 24.571428571428573) internal successors, (172), 6 states have internal predecessors, (172), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 95 [2024-10-11 16:39:27,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 16:39:27,005 INFO L225 Difference]: With dead ends: 793 [2024-10-11 16:39:27,005 INFO L226 Difference]: Without dead ends: 787 [2024-10-11 16:39:27,005 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 195 GetRequests, 190 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-11 16:39:27,006 INFO L432 NwaCegarLoop]: 321 mSDtfsCounter, 1717 mSDsluCounter, 1065 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1733 SdHoareTripleChecker+Valid, 1386 SdHoareTripleChecker+Invalid, 112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 16:39:27,006 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1733 Valid, 1386 Invalid, 112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 16:39:27,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 787 states. [2024-10-11 16:39:27,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 787 to 785. [2024-10-11 16:39:27,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 785 states, 771 states have (on average 1.4020752269779506) internal successors, (1081), 771 states have internal predecessors, (1081), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-11 16:39:27,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 785 states to 785 states and 1105 transitions. [2024-10-11 16:39:27,026 INFO L78 Accepts]: Start accepts. Automaton has 785 states and 1105 transitions. Word has length 95 [2024-10-11 16:39:27,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 16:39:27,027 INFO L471 AbstractCegarLoop]: Abstraction has 785 states and 1105 transitions. [2024-10-11 16:39:27,027 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 24.571428571428573) internal successors, (172), 6 states have internal predecessors, (172), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-11 16:39:27,027 INFO L276 IsEmpty]: Start isEmpty. Operand 785 states and 1105 transitions. [2024-10-11 16:39:27,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 321 [2024-10-11 16:39:27,031 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 16:39:27,032 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 16:39:27,050 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-10-11 16:39:27,232 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 16:39:27,233 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 16:39:27,233 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 16:39:27,236 INFO L85 PathProgramCache]: Analyzing trace with hash 1508188597, now seen corresponding path program 1 times [2024-10-11 16:39:27,237 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 16:39:27,237 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1198313741] [2024-10-11 16:39:27,237 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 16:39:27,237 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 16:39:27,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:39:27,763 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-11 16:39:27,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:39:27,769 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-11 16:39:27,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:39:27,773 INFO L134 CoverageAnalysis]: Checked inductivity of 451 backedges. 4 proven. 162 refuted. 0 times theorem prover too weak. 285 trivial. 0 not checked. [2024-10-11 16:39:27,773 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 16:39:27,773 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1198313741] [2024-10-11 16:39:27,773 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1198313741] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 16:39:27,773 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1355084029] [2024-10-11 16:39:27,773 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 16:39:27,773 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 16:39:27,773 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 16:39:27,775 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 16:39:27,776 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-11 16:39:28,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:39:28,193 INFO L255 TraceCheckSpWp]: Trace formula consists of 1658 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-11 16:39:28,241 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 16:39:28,610 INFO L134 CoverageAnalysis]: Checked inductivity of 451 backedges. 0 proven. 448 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-11 16:39:28,611 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 16:39:28,958 INFO L134 CoverageAnalysis]: Checked inductivity of 451 backedges. 0 proven. 448 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-11 16:39:28,958 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1355084029] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 16:39:28,958 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 16:39:28,958 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 7, 7] total 15 [2024-10-11 16:39:28,958 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [521837581] [2024-10-11 16:39:28,959 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 16:39:28,960 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-10-11 16:39:28,960 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 16:39:28,965 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-10-11 16:39:28,965 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=138, Unknown=0, NotChecked=0, Total=210 [2024-10-11 16:39:28,965 INFO L87 Difference]: Start difference. First operand 785 states and 1105 transitions. Second operand has 15 states, 15 states have (on average 50.86666666666667) internal successors, (763), 14 states have internal predecessors, (763), 3 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2024-10-11 16:39:29,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 16:39:29,922 INFO L93 Difference]: Finished difference Result 2331 states and 3313 transitions. [2024-10-11 16:39:29,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-10-11 16:39:29,923 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 50.86666666666667) internal successors, (763), 14 states have internal predecessors, (763), 3 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 320 [2024-10-11 16:39:29,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 16:39:29,929 INFO L225 Difference]: With dead ends: 2331 [2024-10-11 16:39:29,929 INFO L226 Difference]: Without dead ends: 1871 [2024-10-11 16:39:29,930 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 659 GetRequests, 634 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=240, Invalid=462, Unknown=0, NotChecked=0, Total=702 [2024-10-11 16:39:29,931 INFO L432 NwaCegarLoop]: 491 mSDtfsCounter, 7329 mSDsluCounter, 2771 mSDsCounter, 0 mSdLazyCounter, 463 mSolverCounterSat, 73 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7329 SdHoareTripleChecker+Valid, 3262 SdHoareTripleChecker+Invalid, 536 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 73 IncrementalHoareTripleChecker+Valid, 463 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-11 16:39:29,931 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7329 Valid, 3262 Invalid, 536 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [73 Valid, 463 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-11 16:39:29,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1871 states. [2024-10-11 16:39:29,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1871 to 1869. [2024-10-11 16:39:29,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1869 states, 1855 states have (on average 1.411320754716981) internal successors, (2618), 1855 states have internal predecessors, (2618), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-11 16:39:29,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1869 states to 1869 states and 2642 transitions. [2024-10-11 16:39:29,962 INFO L78 Accepts]: Start accepts. Automaton has 1869 states and 2642 transitions. Word has length 320 [2024-10-11 16:39:29,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 16:39:29,962 INFO L471 AbstractCegarLoop]: Abstraction has 1869 states and 2642 transitions. [2024-10-11 16:39:29,963 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 50.86666666666667) internal successors, (763), 14 states have internal predecessors, (763), 3 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2024-10-11 16:39:29,963 INFO L276 IsEmpty]: Start isEmpty. Operand 1869 states and 2642 transitions. [2024-10-11 16:39:29,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 772 [2024-10-11 16:39:29,973 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 16:39:29,973 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 16:39:29,990 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-11 16:39:30,174 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,3 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 16:39:30,174 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 16:39:30,174 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 16:39:30,174 INFO L85 PathProgramCache]: Analyzing trace with hash -1464386246, now seen corresponding path program 1 times [2024-10-11 16:39:30,175 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 16:39:30,175 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1954566380] [2024-10-11 16:39:30,175 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 16:39:30,175 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms