./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-64.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a0165632 Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_78b46f5b-c71d-4681-9e10-bcbca639fe81/bin/uautomizer-verify-jihMAELWvX/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_78b46f5b-c71d-4681-9e10-bcbca639fe81/bin/uautomizer-verify-jihMAELWvX/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_78b46f5b-c71d-4681-9e10-bcbca639fe81/bin/uautomizer-verify-jihMAELWvX/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_78b46f5b-c71d-4681-9e10-bcbca639fe81/bin/uautomizer-verify-jihMAELWvX/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-64.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_78b46f5b-c71d-4681-9e10-bcbca639fe81/bin/uautomizer-verify-jihMAELWvX/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_78b46f5b-c71d-4681-9e10-bcbca639fe81/bin/uautomizer-verify-jihMAELWvX --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 2296f8bb93bd4140c35d0b2800df8c874c564098ef0aa8a507c2732dcd35dc25 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-a016563 [2024-11-08 19:07:40,522 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 19:07:40,637 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_78b46f5b-c71d-4681-9e10-bcbca639fe81/bin/uautomizer-verify-jihMAELWvX/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-08 19:07:40,646 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 19:07:40,646 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 19:07:40,697 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 19:07:40,698 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 19:07:40,699 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 19:07:40,700 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 19:07:40,702 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 19:07:40,703 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 19:07:40,703 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 19:07:40,705 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 19:07:40,706 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 19:07:40,708 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 19:07:40,709 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 19:07:40,710 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 19:07:40,710 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 19:07:40,710 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-08 19:07:40,711 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 19:07:40,711 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 19:07:40,716 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 19:07:40,716 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 19:07:40,716 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 19:07:40,717 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 19:07:40,717 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 19:07:40,717 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 19:07:40,718 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 19:07:40,718 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 19:07:40,718 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 19:07:40,719 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 19:07:40,719 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 19:07:40,722 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 19:07:40,722 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 19:07:40,723 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 19:07:40,723 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 19:07:40,724 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-08 19:07:40,724 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-08 19:07:40,724 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 19:07:40,725 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 19:07:40,725 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 19:07:40,726 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 19:07:40,726 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:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_78b46f5b-c71d-4681-9e10-bcbca639fe81/bin/uautomizer-verify-jihMAELWvX/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 -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_78b46f5b-c71d-4681-9e10-bcbca639fe81/bin/uautomizer-verify-jihMAELWvX 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 -> 2296f8bb93bd4140c35d0b2800df8c874c564098ef0aa8a507c2732dcd35dc25 [2024-11-08 19:07:41,209 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 19:07:41,248 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 19:07:41,253 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 19:07:41,255 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 19:07:41,256 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 19:07:41,258 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_78b46f5b-c71d-4681-9e10-bcbca639fe81/bin/uautomizer-verify-jihMAELWvX/../../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-64.i Unable to find full path for "g++" [2024-11-08 19:07:44,032 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 19:07:44,387 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 19:07:44,388 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_78b46f5b-c71d-4681-9e10-bcbca639fe81/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-64.i [2024-11-08 19:07:44,402 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_78b46f5b-c71d-4681-9e10-bcbca639fe81/bin/uautomizer-verify-jihMAELWvX/data/3a8b6df8c/4971967d672144d7a88ec5a4158ac013/FLAGf654105bf [2024-11-08 19:07:44,423 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_78b46f5b-c71d-4681-9e10-bcbca639fe81/bin/uautomizer-verify-jihMAELWvX/data/3a8b6df8c/4971967d672144d7a88ec5a4158ac013 [2024-11-08 19:07:44,427 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 19:07:44,429 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 19:07:44,431 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 19:07:44,432 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 19:07:44,440 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 19:07:44,444 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 07:07:44" (1/1) ... [2024-11-08 19:07:44,446 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@78e9b31b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:07:44, skipping insertion in model container [2024-11-08 19:07:44,446 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 07:07:44" (1/1) ... [2024-11-08 19:07:44,494 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 19:07:44,770 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_78b46f5b-c71d-4681-9e10-bcbca639fe81/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-64.i[919,932] [2024-11-08 19:07:44,850 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 19:07:44,875 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 19:07:44,889 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_78b46f5b-c71d-4681-9e10-bcbca639fe81/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-64.i[919,932] [2024-11-08 19:07:44,927 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 19:07:44,956 INFO L204 MainTranslator]: Completed translation [2024-11-08 19:07:44,956 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:07:44 WrapperNode [2024-11-08 19:07:44,957 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 19:07:44,958 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 19:07:44,959 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 19:07:44,959 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 19:07:44,970 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:07:44" (1/1) ... [2024-11-08 19:07:44,982 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:07:44" (1/1) ... [2024-11-08 19:07:45,022 INFO L138 Inliner]: procedures = 26, calls = 39, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 171 [2024-11-08 19:07:45,023 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 19:07:45,024 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 19:07:45,025 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 19:07:45,025 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 19:07:45,041 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:07:44" (1/1) ... [2024-11-08 19:07:45,041 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:07:44" (1/1) ... [2024-11-08 19:07:45,045 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:07:44" (1/1) ... [2024-11-08 19:07:45,064 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-08 19:07:45,065 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:07:44" (1/1) ... [2024-11-08 19:07:45,065 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:07:44" (1/1) ... [2024-11-08 19:07:45,072 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:07:44" (1/1) ... [2024-11-08 19:07:45,077 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:07:44" (1/1) ... [2024-11-08 19:07:45,079 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:07:44" (1/1) ... [2024-11-08 19:07:45,081 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:07:44" (1/1) ... [2024-11-08 19:07:45,084 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 19:07:45,085 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 19:07:45,085 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 19:07:45,086 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 19:07:45,087 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:07:44" (1/1) ... [2024-11-08 19:07:45,095 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 19:07:45,127 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_78b46f5b-c71d-4681-9e10-bcbca639fe81/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 19:07:45,151 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_78b46f5b-c71d-4681-9e10-bcbca639fe81/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-08 19:07:45,159 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_78b46f5b-c71d-4681-9e10-bcbca639fe81/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-08 19:07:45,199 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 19:07:45,200 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-08 19:07:45,202 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-08 19:07:45,202 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-08 19:07:45,202 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 19:07:45,202 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 19:07:45,308 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 19:07:45,312 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 19:07:45,840 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2024-11-08 19:07:45,840 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 19:07:45,857 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 19:07:45,858 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-08 19:07:45,858 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 07:07:45 BoogieIcfgContainer [2024-11-08 19:07:45,858 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 19:07:45,862 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 19:07:45,862 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 19:07:45,867 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 19:07:45,867 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 07:07:44" (1/3) ... [2024-11-08 19:07:45,869 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@75643bb4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 07:07:45, skipping insertion in model container [2024-11-08 19:07:45,869 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:07:44" (2/3) ... [2024-11-08 19:07:45,870 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@75643bb4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 07:07:45, skipping insertion in model container [2024-11-08 19:07:45,870 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 07:07:45" (3/3) ... [2024-11-08 19:07:45,872 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_codestructure_dependencies_file-64.i [2024-11-08 19:07:45,896 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 19:07:45,896 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-08 19:07:45,990 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 19:07:45,999 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;@4659a94d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 19:07:46,000 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 19:07:46,006 INFO L276 IsEmpty]: Start isEmpty. Operand has 74 states, 45 states have (on average 1.3777777777777778) internal successors, (62), 46 states have internal predecessors, (62), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2024-11-08 19:07:46,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2024-11-08 19:07:46,027 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 19:07:46,028 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 19:07:46,029 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 19:07:46,037 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 19:07:46,037 INFO L85 PathProgramCache]: Analyzing trace with hash -1081885226, now seen corresponding path program 1 times [2024-11-08 19:07:46,050 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 19:07:46,051 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [813215648] [2024-11-08 19:07:46,052 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:07:46,052 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:07:46,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:07:46,571 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 19:07:46,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:07:46,589 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 19:07:46,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:07:46,599 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 19:07:46,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:07:46,606 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 19:07:46,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:07:46,626 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 19:07:46,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:07:46,636 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 19:07:46,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:07:46,647 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 19:07:46,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:07:46,654 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 19:07:46,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:07:46,662 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-08 19:07:46,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:07:46,668 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 19:07:46,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:07:46,675 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-08 19:07:46,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:07:46,681 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 19:07:46,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:07:46,688 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 19:07:46,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:07:46,694 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-08 19:07:46,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:07:46,701 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-08 19:07:46,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:07:46,713 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-08 19:07:46,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:07:46,727 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-08 19:07:46,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:07:46,732 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-08 19:07:46,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:07:46,742 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-08 19:07:46,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:07:46,755 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-08 19:07:46,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:07:46,761 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-08 19:07:46,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:07:46,775 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-08 19:07:46,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:07:46,784 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-08 19:07:46,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:07:46,793 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-08 19:07:46,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:07:46,805 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-11-08 19:07:46,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:07:46,815 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-11-08 19:07:46,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:07:46,829 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-11-08 19:07:46,832 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 19:07:46,833 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [813215648] [2024-11-08 19:07:46,834 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [813215648] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 19:07:46,834 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 19:07:46,835 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 19:07:46,837 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [955577865] [2024-11-08 19:07:46,838 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 19:07:46,846 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-08 19:07:46,847 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 19:07:46,884 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-08 19:07:46,885 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 19:07:46,889 INFO L87 Difference]: Start difference. First operand has 74 states, 45 states have (on average 1.3777777777777778) internal successors, (62), 46 states have internal predecessors, (62), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) Second operand has 2 states, 2 states have (on average 17.5) internal successors, (35), 2 states have internal predecessors, (35), 2 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 2 states have call successors, (26) [2024-11-08 19:07:46,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 19:07:46,945 INFO L93 Difference]: Finished difference Result 141 states and 248 transitions. [2024-11-08 19:07:46,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-08 19:07:46,947 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 17.5) internal successors, (35), 2 states have internal predecessors, (35), 2 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 2 states have call successors, (26) Word has length 162 [2024-11-08 19:07:46,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 19:07:46,958 INFO L225 Difference]: With dead ends: 141 [2024-11-08 19:07:46,959 INFO L226 Difference]: Without dead ends: 70 [2024-11-08 19:07:46,963 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 19:07:46,968 INFO L432 NwaCegarLoop]: 107 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 107 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 19:07:46,969 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 107 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 19:07:46,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2024-11-08 19:07:47,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2024-11-08 19:07:47,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 42 states have (on average 1.3095238095238095) internal successors, (55), 42 states have internal predecessors, (55), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2024-11-08 19:07:47,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 107 transitions. [2024-11-08 19:07:47,058 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 107 transitions. Word has length 162 [2024-11-08 19:07:47,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 19:07:47,062 INFO L471 AbstractCegarLoop]: Abstraction has 70 states and 107 transitions. [2024-11-08 19:07:47,062 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 17.5) internal successors, (35), 2 states have internal predecessors, (35), 2 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 2 states have call successors, (26) [2024-11-08 19:07:47,063 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 107 transitions. [2024-11-08 19:07:47,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2024-11-08 19:07:47,071 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 19:07:47,071 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 19:07:47,071 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-08 19:07:47,072 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 19:07:47,074 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 19:07:47,075 INFO L85 PathProgramCache]: Analyzing trace with hash 1852900502, now seen corresponding path program 1 times [2024-11-08 19:07:47,075 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 19:07:47,075 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1476986257] [2024-11-08 19:07:47,076 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:07:47,076 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:07:47,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:07:52,393 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 19:07:52,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:07:52,400 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 19:07:52,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:07:52,404 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 19:07:52,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:07:52,409 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 19:07:52,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:07:52,415 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 19:07:52,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:07:52,421 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 19:07:52,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:07:52,426 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 19:07:52,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:07:52,432 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 19:07:52,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:07:52,437 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-08 19:07:52,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:07:52,445 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 19:07:52,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:07:52,450 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-08 19:07:52,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:07:52,454 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 19:07:52,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:07:52,457 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 19:07:52,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:07:52,460 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-08 19:07:52,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:07:52,464 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-08 19:07:52,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:07:52,467 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-08 19:07:52,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:07:52,471 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-08 19:07:52,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:07:52,474 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-08 19:07:52,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:07:52,477 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-08 19:07:52,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:07:52,481 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-08 19:07:52,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:07:52,485 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-08 19:07:52,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:07:52,492 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-08 19:07:52,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:07:52,499 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-08 19:07:52,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:07:52,504 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-08 19:07:52,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:07:52,509 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-11-08 19:07:52,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:07:52,514 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-11-08 19:07:52,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:07:52,518 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-11-08 19:07:52,518 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 19:07:52,519 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1476986257] [2024-11-08 19:07:52,519 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1476986257] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 19:07:52,519 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 19:07:52,521 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 19:07:52,521 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [306782918] [2024-11-08 19:07:52,523 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 19:07:52,525 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 19:07:52,526 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 19:07:52,528 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 19:07:52,529 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-08 19:07:52,529 INFO L87 Difference]: Start difference. First operand 70 states and 107 transitions. Second operand has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-08 19:07:53,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 19:07:53,107 INFO L93 Difference]: Finished difference Result 244 states and 375 transitions. [2024-11-08 19:07:53,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 19:07:53,108 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 162 [2024-11-08 19:07:53,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 19:07:53,112 INFO L225 Difference]: With dead ends: 244 [2024-11-08 19:07:53,112 INFO L226 Difference]: Without dead ends: 177 [2024-11-08 19:07:53,113 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-08 19:07:53,115 INFO L432 NwaCegarLoop]: 171 mSDtfsCounter, 127 mSDsluCounter, 287 mSDsCounter, 0 mSdLazyCounter, 115 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 458 SdHoareTripleChecker+Invalid, 169 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-08 19:07:53,115 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [127 Valid, 458 Invalid, 169 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 115 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-08 19:07:53,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2024-11-08 19:07:53,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 74. [2024-11-08 19:07:53,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 46 states have (on average 1.326086956521739) internal successors, (61), 46 states have internal predecessors, (61), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2024-11-08 19:07:53,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 113 transitions. [2024-11-08 19:07:53,144 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 113 transitions. Word has length 162 [2024-11-08 19:07:53,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 19:07:53,146 INFO L471 AbstractCegarLoop]: Abstraction has 74 states and 113 transitions. [2024-11-08 19:07:53,147 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-08 19:07:53,147 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 113 transitions. [2024-11-08 19:07:53,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2024-11-08 19:07:53,150 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 19:07:53,150 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 19:07:53,150 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-08 19:07:53,151 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 19:07:53,151 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 19:07:53,151 INFO L85 PathProgramCache]: Analyzing trace with hash -1924913770, now seen corresponding path program 1 times [2024-11-08 19:07:53,151 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 19:07:53,152 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [394195124] [2024-11-08 19:07:53,152 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:07:53,152 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:07:53,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:07:53,468 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 19:07:53,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:07:53,472 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 19:07:53,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:07:53,476 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 19:07:53,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:07:53,480 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 19:07:53,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:07:53,483 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 19:07:53,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:07:53,487 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 19:07:53,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:07:53,491 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 19:07:53,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:07:53,495 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 19:07:53,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:07:53,499 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-08 19:07:53,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:07:53,503 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 19:07:53,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:07:53,506 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-08 19:07:53,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:07:53,510 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 19:07:53,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:07:53,514 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 19:07:53,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:07:53,517 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-08 19:07:53,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:07:53,521 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-08 19:07:53,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:07:53,525 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-08 19:07:53,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:07:53,528 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-08 19:07:53,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:07:53,532 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-08 19:07:53,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:07:53,536 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-08 19:07:53,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:07:53,540 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-08 19:07:53,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:07:53,543 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-08 19:07:53,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:07:53,547 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-08 19:07:53,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:07:53,551 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-08 19:07:53,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:07:53,556 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-08 19:07:53,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:07:53,560 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-11-08 19:07:53,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:07:53,564 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-11-08 19:07:53,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:07:53,569 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-11-08 19:07:53,570 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 19:07:53,570 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [394195124] [2024-11-08 19:07:53,571 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [394195124] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 19:07:53,571 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 19:07:53,571 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 19:07:53,571 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [567104270] [2024-11-08 19:07:53,572 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 19:07:53,572 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 19:07:53,572 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 19:07:53,577 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 19:07:53,578 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-08 19:07:53,578 INFO L87 Difference]: Start difference. First operand 74 states and 113 transitions. Second operand has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-08 19:07:53,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 19:07:53,895 INFO L93 Difference]: Finished difference Result 217 states and 328 transitions. [2024-11-08 19:07:53,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 19:07:53,896 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 162 [2024-11-08 19:07:53,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 19:07:53,899 INFO L225 Difference]: With dead ends: 217 [2024-11-08 19:07:53,899 INFO L226 Difference]: Without dead ends: 146 [2024-11-08 19:07:53,900 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-08 19:07:53,902 INFO L432 NwaCegarLoop]: 187 mSDtfsCounter, 117 mSDsluCounter, 299 mSDsCounter, 0 mSdLazyCounter, 116 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 486 SdHoareTripleChecker+Invalid, 116 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-08 19:07:53,902 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [117 Valid, 486 Invalid, 116 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 116 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-08 19:07:53,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2024-11-08 19:07:53,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 74. [2024-11-08 19:07:53,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 46 states have (on average 1.326086956521739) internal successors, (61), 46 states have internal predecessors, (61), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2024-11-08 19:07:53,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 113 transitions. [2024-11-08 19:07:53,915 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 113 transitions. Word has length 162 [2024-11-08 19:07:53,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 19:07:53,916 INFO L471 AbstractCegarLoop]: Abstraction has 74 states and 113 transitions. [2024-11-08 19:07:53,916 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-08 19:07:53,917 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 113 transitions. [2024-11-08 19:07:53,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2024-11-08 19:07:53,923 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 19:07:53,923 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 19:07:53,923 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-08 19:07:53,923 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 19:07:53,924 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 19:07:53,924 INFO L85 PathProgramCache]: Analyzing trace with hash 1560706900, now seen corresponding path program 1 times [2024-11-08 19:07:53,924 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 19:07:53,924 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1583418465] [2024-11-08 19:07:53,924 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:07:53,925 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:07:53,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:07:54,160 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 19:07:54,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:07:54,164 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 19:07:54,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:07:54,170 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 19:07:54,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:07:54,174 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 19:07:54,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:07:54,177 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 19:07:54,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:07:54,184 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 19:07:54,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:07:54,187 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 19:07:54,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:07:54,189 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 19:07:54,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:07:54,193 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-08 19:07:54,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:07:54,196 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 19:07:54,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:07:54,198 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-08 19:07:54,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:07:54,201 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 19:07:54,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:07:54,204 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 19:07:54,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:07:54,207 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-08 19:07:54,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:07:54,210 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-08 19:07:54,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:07:54,213 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-08 19:07:54,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:07:54,216 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-08 19:07:54,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:07:54,219 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-08 19:07:54,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:07:54,224 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-08 19:07:54,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:07:54,227 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-08 19:07:54,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:07:54,229 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-08 19:07:54,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:07:54,236 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-08 19:07:54,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:07:54,243 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-08 19:07:54,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:07:54,246 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-08 19:07:54,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:07:54,248 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-11-08 19:07:54,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:07:54,251 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-11-08 19:07:54,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:07:54,256 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-11-08 19:07:54,256 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 19:07:54,256 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1583418465] [2024-11-08 19:07:54,256 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1583418465] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 19:07:54,257 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 19:07:54,257 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 19:07:54,257 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1293605540] [2024-11-08 19:07:54,257 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 19:07:54,258 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 19:07:54,258 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 19:07:54,259 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 19:07:54,260 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-08 19:07:54,260 INFO L87 Difference]: Start difference. First operand 74 states and 113 transitions. Second operand has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-08 19:07:54,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 19:07:54,489 INFO L93 Difference]: Finished difference Result 217 states and 327 transitions. [2024-11-08 19:07:54,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 19:07:54,490 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 162 [2024-11-08 19:07:54,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 19:07:54,497 INFO L225 Difference]: With dead ends: 217 [2024-11-08 19:07:54,497 INFO L226 Difference]: Without dead ends: 146 [2024-11-08 19:07:54,498 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-08 19:07:54,499 INFO L432 NwaCegarLoop]: 207 mSDtfsCounter, 107 mSDsluCounter, 327 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 534 SdHoareTripleChecker+Invalid, 96 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-08 19:07:54,500 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [107 Valid, 534 Invalid, 96 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-08 19:07:54,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2024-11-08 19:07:54,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 70. [2024-11-08 19:07:54,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 42 states have (on average 1.2857142857142858) internal successors, (54), 42 states have internal predecessors, (54), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2024-11-08 19:07:54,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 106 transitions. [2024-11-08 19:07:54,513 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 106 transitions. Word has length 162 [2024-11-08 19:07:54,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 19:07:54,514 INFO L471 AbstractCegarLoop]: Abstraction has 70 states and 106 transitions. [2024-11-08 19:07:54,514 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-08 19:07:54,514 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 106 transitions. [2024-11-08 19:07:54,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2024-11-08 19:07:54,517 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 19:07:54,517 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 19:07:54,518 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-08 19:07:54,518 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 19:07:54,518 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 19:07:54,519 INFO L85 PathProgramCache]: Analyzing trace with hash 1972466737, now seen corresponding path program 1 times [2024-11-08 19:07:54,519 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 19:07:54,519 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1749609162] [2024-11-08 19:07:54,519 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:07:54,519 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:07:54,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:15:32,104 WARN L286 SmtUtils]: Spent 21.88s on a formula simplification. DAG size of input: 225 DAG size of output: 211 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-08 19:18:44,193 WARN L286 SmtUtils]: Spent 1.36m on a formula simplification. DAG size of input: 244 DAG size of output: 229 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-08 19:21:32,404 WARN L286 SmtUtils]: Spent 58.56s on a formula simplification. DAG size of input: 185 DAG size of output: 171 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-08 19:21:33,236 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 19:21:33,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:21:33,239 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 19:21:33,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:21:33,242 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 19:21:33,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:21:33,244 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 19:21:33,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:21:33,247 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 19:21:33,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:21:33,249 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 19:21:33,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:21:33,252 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 19:21:33,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:21:33,255 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 19:21:33,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:21:33,258 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-08 19:21:33,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:21:33,260 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 19:21:33,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:21:33,263 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-08 19:21:33,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:21:33,266 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 19:21:33,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:21:33,269 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 19:21:33,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:21:33,272 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-08 19:21:33,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:21:33,275 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-08 19:21:33,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:21:33,278 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-08 19:21:33,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:21:33,280 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-08 19:21:33,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:21:33,283 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-08 19:21:33,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:21:33,286 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-08 19:21:33,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:21:33,290 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-08 19:21:33,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:21:33,293 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-08 19:21:33,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:21:33,297 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-08 19:21:33,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:21:33,301 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-08 19:21:33,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:21:33,304 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-08 19:21:33,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:21:33,308 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-11-08 19:21:33,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:21:33,311 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-11-08 19:21:33,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:21:33,317 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-11-08 19:21:33,317 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 19:21:33,318 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1749609162] [2024-11-08 19:21:33,318 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1749609162] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 19:21:33,318 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 19:21:33,318 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-11-08 19:21:33,319 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [623647132] [2024-11-08 19:21:33,319 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 19:21:33,321 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-08 19:21:33,322 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 19:21:33,323 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-08 19:21:33,324 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2024-11-08 19:21:33,325 INFO L87 Difference]: Start difference. First operand 70 states and 106 transitions. Second operand has 13 states, 13 states have (on average 2.8461538461538463) internal successors, (37), 13 states have internal predecessors, (37), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-08 19:22:06,699 WARN L286 SmtUtils]: Spent 29.90s on a formula simplification. DAG size of input: 250 DAG size of output: 224 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-08 19:22:26,055 WARN L286 SmtUtils]: Spent 19.06s on a formula simplification that was a NOOP. DAG size: 212 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-08 19:22:40,333 WARN L286 SmtUtils]: Spent 13.67s on a formula simplification that was a NOOP. DAG size: 214 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate)