./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount100_file-53.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 4fc63b2a 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_81d02066-945c-4225-a69a-519eb515a3fd/bin/uautomizer-verify-4GaUIPS5ZU/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81d02066-945c-4225-a69a-519eb515a3fd/bin/uautomizer-verify-4GaUIPS5ZU/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81d02066-945c-4225-a69a-519eb515a3fd/bin/uautomizer-verify-4GaUIPS5ZU/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81d02066-945c-4225-a69a-519eb515a3fd/bin/uautomizer-verify-4GaUIPS5ZU/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount100_file-53.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81d02066-945c-4225-a69a-519eb515a3fd/bin/uautomizer-verify-4GaUIPS5ZU/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81d02066-945c-4225-a69a-519eb515a3fd/bin/uautomizer-verify-4GaUIPS5ZU --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 71c7df1fae20fc80c584d7fcd9c77a1cbb9d81b2af2b3bc6d67d6058472b2f60 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4fc63b2 [2024-10-31 22:09:25,905 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-31 22:09:25,994 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81d02066-945c-4225-a69a-519eb515a3fd/bin/uautomizer-verify-4GaUIPS5ZU/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-31 22:09:25,999 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-31 22:09:26,000 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-31 22:09:26,025 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-31 22:09:26,027 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-31 22:09:26,027 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-31 22:09:26,028 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-31 22:09:26,029 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-31 22:09:26,031 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-31 22:09:26,031 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-31 22:09:26,032 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-31 22:09:26,033 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-31 22:09:26,037 INFO L153 SettingsManager]: * Use SBE=true [2024-10-31 22:09:26,037 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-31 22:09:26,038 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-31 22:09:26,038 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-31 22:09:26,038 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-31 22:09:26,039 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-31 22:09:26,039 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-31 22:09:26,040 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-31 22:09:26,040 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-31 22:09:26,040 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-31 22:09:26,040 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-31 22:09:26,041 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-31 22:09:26,041 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-31 22:09:26,041 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-31 22:09:26,042 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-31 22:09:26,042 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-31 22:09:26,042 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-31 22:09:26,043 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-31 22:09:26,045 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-31 22:09:26,046 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-31 22:09:26,046 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-31 22:09:26,047 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-31 22:09:26,048 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-31 22:09:26,048 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-31 22:09:26,048 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-31 22:09:26,048 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-31 22:09:26,049 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-31 22:09:26,049 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-31 22:09:26,049 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_81d02066-945c-4225-a69a-519eb515a3fd/bin/uautomizer-verify-4GaUIPS5ZU/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_81d02066-945c-4225-a69a-519eb515a3fd/bin/uautomizer-verify-4GaUIPS5ZU 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 -> 71c7df1fae20fc80c584d7fcd9c77a1cbb9d81b2af2b3bc6d67d6058472b2f60 [2024-10-31 22:09:26,353 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-31 22:09:26,380 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-31 22:09:26,383 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-31 22:09:26,384 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-31 22:09:26,385 INFO L274 PluginConnector]: CDTParser initialized [2024-10-31 22:09:26,386 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81d02066-945c-4225-a69a-519eb515a3fd/bin/uautomizer-verify-4GaUIPS5ZU/../../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount100_file-53.i Unable to find full path for "g++" [2024-10-31 22:09:28,379 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-31 22:09:28,596 INFO L384 CDTParser]: Found 1 translation units. [2024-10-31 22:09:28,600 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81d02066-945c-4225-a69a-519eb515a3fd/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount100_file-53.i [2024-10-31 22:09:28,622 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81d02066-945c-4225-a69a-519eb515a3fd/bin/uautomizer-verify-4GaUIPS5ZU/data/3266de377/ee365ecd5d1c464bbcbba91eaccbc0ab/FLAG960dc68f1 [2024-10-31 22:09:28,659 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81d02066-945c-4225-a69a-519eb515a3fd/bin/uautomizer-verify-4GaUIPS5ZU/data/3266de377/ee365ecd5d1c464bbcbba91eaccbc0ab [2024-10-31 22:09:28,665 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-31 22:09:28,668 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-31 22:09:28,674 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-31 22:09:28,674 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-31 22:09:28,689 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-31 22:09:28,694 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.10 10:09:28" (1/1) ... [2024-10-31 22:09:28,698 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4fa6aba5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:09:28, skipping insertion in model container [2024-10-31 22:09:28,698 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.10 10:09:28" (1/1) ... [2024-10-31 22:09:28,770 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-31 22:09:28,990 WARN L251 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_81d02066-945c-4225-a69a-519eb515a3fd/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount100_file-53.i[916,929] [2024-10-31 22:09:29,165 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-31 22:09:29,197 INFO L200 MainTranslator]: Completed pre-run [2024-10-31 22:09:29,228 WARN L251 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_81d02066-945c-4225-a69a-519eb515a3fd/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount100_file-53.i[916,929] [2024-10-31 22:09:29,318 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-31 22:09:29,350 INFO L204 MainTranslator]: Completed translation [2024-10-31 22:09:29,350 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:09:29 WrapperNode [2024-10-31 22:09:29,351 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-31 22:09:29,352 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-31 22:09:29,352 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-31 22:09:29,352 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-31 22:09:29,360 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:09:29" (1/1) ... [2024-10-31 22:09:29,374 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:09:29" (1/1) ... [2024-10-31 22:09:29,458 INFO L138 Inliner]: procedures = 26, calls = 38, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 220 [2024-10-31 22:09:29,459 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-31 22:09:29,460 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-31 22:09:29,460 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-31 22:09:29,460 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-31 22:09:29,473 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:09:29" (1/1) ... [2024-10-31 22:09:29,473 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:09:29" (1/1) ... [2024-10-31 22:09:29,487 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:09:29" (1/1) ... [2024-10-31 22:09:29,536 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-10-31 22:09:29,537 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:09:29" (1/1) ... [2024-10-31 22:09:29,537 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:09:29" (1/1) ... [2024-10-31 22:09:29,561 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:09:29" (1/1) ... [2024-10-31 22:09:29,569 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:09:29" (1/1) ... [2024-10-31 22:09:29,576 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:09:29" (1/1) ... [2024-10-31 22:09:29,584 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:09:29" (1/1) ... [2024-10-31 22:09:29,598 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-31 22:09:29,600 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-31 22:09:29,600 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-31 22:09:29,600 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-31 22:09:29,601 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:09:29" (1/1) ... [2024-10-31 22:09:29,608 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-31 22:09:29,629 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81d02066-945c-4225-a69a-519eb515a3fd/bin/uautomizer-verify-4GaUIPS5ZU/z3 [2024-10-31 22:09:29,659 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81d02066-945c-4225-a69a-519eb515a3fd/bin/uautomizer-verify-4GaUIPS5ZU/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-31 22:09:29,671 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81d02066-945c-4225-a69a-519eb515a3fd/bin/uautomizer-verify-4GaUIPS5ZU/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-31 22:09:29,717 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-31 22:09:29,718 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-31 22:09:29,719 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-31 22:09:29,719 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-31 22:09:29,719 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-31 22:09:29,719 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-31 22:09:29,854 INFO L238 CfgBuilder]: Building ICFG [2024-10-31 22:09:29,858 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-31 22:09:30,614 INFO L? ?]: Removed 28 outVars from TransFormulas that were not future-live. [2024-10-31 22:09:30,615 INFO L287 CfgBuilder]: Performing block encoding [2024-10-31 22:09:30,634 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-31 22:09:30,635 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-31 22:09:30,635 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.10 10:09:30 BoogieIcfgContainer [2024-10-31 22:09:30,636 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-31 22:09:30,640 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-31 22:09:30,640 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-31 22:09:30,644 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-31 22:09:30,644 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 31.10 10:09:28" (1/3) ... [2024-10-31 22:09:30,645 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@262b1597 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.10 10:09:30, skipping insertion in model container [2024-10-31 22:09:30,645 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:09:29" (2/3) ... [2024-10-31 22:09:30,646 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@262b1597 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.10 10:09:30, skipping insertion in model container [2024-10-31 22:09:30,646 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.10 10:09:30" (3/3) ... [2024-10-31 22:09:30,647 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount100_file-53.i [2024-10-31 22:09:30,667 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-31 22:09:30,667 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-31 22:09:30,747 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-31 22:09:30,766 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;@432e0bf6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-31 22:09:30,766 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-31 22:09:30,774 INFO L276 IsEmpty]: Start isEmpty. Operand has 95 states, 67 states have (on average 1.462686567164179) internal successors, (98), 68 states have internal predecessors, (98), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2024-10-31 22:09:30,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2024-10-31 22:09:30,794 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:09:30,795 INFO L215 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-31 22:09:30,795 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 22:09:30,803 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:09:30,803 INFO L85 PathProgramCache]: Analyzing trace with hash 1745341348, now seen corresponding path program 1 times [2024-10-31 22:09:30,815 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:09:30,815 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [236509552] [2024-10-31 22:09:30,816 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:09:30,816 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:09:30,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:09:31,225 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-31 22:09:31,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:09:31,233 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-31 22:09:31,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:09:31,238 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-31 22:09:31,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:09:31,243 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-31 22:09:31,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:09:31,248 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-10-31 22:09:31,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:09:31,252 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-31 22:09:31,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:09:31,259 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-31 22:09:31,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:09:31,264 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-31 22:09:31,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:09:31,304 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-10-31 22:09:31,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:09:31,313 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-10-31 22:09:31,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:09:31,323 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-10-31 22:09:31,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:09:31,336 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-31 22:09:31,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:09:31,341 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-31 22:09:31,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:09:31,353 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-31 22:09:31,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:09:31,362 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-10-31 22:09:31,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:09:31,370 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-10-31 22:09:31,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:09:31,382 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-10-31 22:09:31,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:09:31,389 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-10-31 22:09:31,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:09:31,395 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-10-31 22:09:31,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:09:31,404 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-10-31 22:09:31,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:09:31,412 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-10-31 22:09:31,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:09:31,418 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-10-31 22:09:31,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:09:31,425 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-10-31 22:09:31,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:09:31,436 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-10-31 22:09:31,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:09:31,441 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-10-31 22:09:31,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:09:31,452 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2024-10-31 22:09:31,456 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:09:31,456 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [236509552] [2024-10-31 22:09:31,457 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [236509552] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:09:31,457 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:09:31,457 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-31 22:09:31,459 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [207043658] [2024-10-31 22:09:31,460 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:09:31,466 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-31 22:09:31,466 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:09:31,495 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-31 22:09:31,496 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-31 22:09:31,499 INFO L87 Difference]: Start difference. First operand has 95 states, 67 states have (on average 1.462686567164179) internal successors, (98), 68 states have internal predecessors, (98), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) Second operand has 2 states, 2 states have (on average 23.5) internal successors, (47), 2 states have internal predecessors, (47), 2 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 2 states have call successors, (25) [2024-10-31 22:09:31,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:09:31,544 INFO L93 Difference]: Finished difference Result 183 states and 315 transitions. [2024-10-31 22:09:31,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-31 22:09:31,546 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 23.5) internal successors, (47), 2 states have internal predecessors, (47), 2 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 2 states have call successors, (25) Word has length 169 [2024-10-31 22:09:31,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:09:31,554 INFO L225 Difference]: With dead ends: 183 [2024-10-31 22:09:31,554 INFO L226 Difference]: Without dead ends: 91 [2024-10-31 22:09:31,558 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 77 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-31 22:09:31,563 INFO L432 NwaCegarLoop]: 141 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 141 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-31 22:09:31,566 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 141 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-31 22:09:31,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2024-10-31 22:09:31,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2024-10-31 22:09:31,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 64 states have (on average 1.421875) internal successors, (91), 64 states have internal predecessors, (91), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2024-10-31 22:09:31,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 141 transitions. [2024-10-31 22:09:31,632 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 141 transitions. Word has length 169 [2024-10-31 22:09:31,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:09:31,632 INFO L471 AbstractCegarLoop]: Abstraction has 91 states and 141 transitions. [2024-10-31 22:09:31,633 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 23.5) internal successors, (47), 2 states have internal predecessors, (47), 2 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 2 states have call successors, (25) [2024-10-31 22:09:31,633 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 141 transitions. [2024-10-31 22:09:31,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2024-10-31 22:09:31,640 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:09:31,641 INFO L215 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-31 22:09:31,641 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-31 22:09:31,642 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 22:09:31,642 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:09:31,642 INFO L85 PathProgramCache]: Analyzing trace with hash -1889066390, now seen corresponding path program 1 times [2024-10-31 22:09:31,642 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:09:31,643 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [59294776] [2024-10-31 22:09:31,643 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:09:31,643 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:09:31,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:09:32,645 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-31 22:09:32,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:09:32,651 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-31 22:09:32,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:09:32,655 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-31 22:09:32,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:09:32,659 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-31 22:09:32,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:09:32,674 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-10-31 22:09:32,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:09:32,679 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-31 22:09:32,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:09:32,684 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-31 22:09:32,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:09:32,690 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-31 22:09:32,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:09:32,694 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-10-31 22:09:32,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:09:32,699 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-10-31 22:09:32,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:09:32,704 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-10-31 22:09:32,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:09:32,708 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-31 22:09:32,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:09:32,713 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-31 22:09:32,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:09:32,718 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-31 22:09:32,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:09:32,723 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-10-31 22:09:32,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:09:32,729 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-10-31 22:09:32,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:09:32,735 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-10-31 22:09:32,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:09:32,739 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-10-31 22:09:32,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:09:32,745 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-10-31 22:09:32,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:09:32,752 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-10-31 22:09:32,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:09:32,756 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-10-31 22:09:32,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:09:32,764 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-10-31 22:09:32,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:09:32,770 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-10-31 22:09:32,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:09:32,775 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-10-31 22:09:32,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:09:32,780 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-10-31 22:09:32,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:09:32,788 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2024-10-31 22:09:32,789 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:09:32,789 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [59294776] [2024-10-31 22:09:32,790 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [59294776] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:09:32,790 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:09:32,790 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-31 22:09:32,790 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1661044779] [2024-10-31 22:09:32,791 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:09:32,794 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-31 22:09:32,795 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:09:32,796 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-31 22:09:32,796 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-31 22:09:32,797 INFO L87 Difference]: Start difference. First operand 91 states and 141 transitions. Second operand has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2024-10-31 22:09:32,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:09:32,929 INFO L93 Difference]: Finished difference Result 227 states and 350 transitions. [2024-10-31 22:09:32,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-31 22:09:32,933 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) Word has length 169 [2024-10-31 22:09:32,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:09:32,936 INFO L225 Difference]: With dead ends: 227 [2024-10-31 22:09:32,937 INFO L226 Difference]: Without dead ends: 139 [2024-10-31 22:09:32,942 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 53 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-31 22:09:32,943 INFO L432 NwaCegarLoop]: 137 mSDtfsCounter, 64 mSDsluCounter, 262 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 399 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-31 22:09:32,944 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 399 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-31 22:09:32,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2024-10-31 22:09:32,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 135. [2024-10-31 22:09:32,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 101 states have (on average 1.4455445544554455) internal successors, (146), 102 states have internal predecessors, (146), 31 states have call successors, (31), 2 states have call predecessors, (31), 2 states have return successors, (31), 30 states have call predecessors, (31), 31 states have call successors, (31) [2024-10-31 22:09:32,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 208 transitions. [2024-10-31 22:09:32,979 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 208 transitions. Word has length 169 [2024-10-31 22:09:32,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:09:32,983 INFO L471 AbstractCegarLoop]: Abstraction has 135 states and 208 transitions. [2024-10-31 22:09:32,984 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2024-10-31 22:09:32,984 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 208 transitions. [2024-10-31 22:09:32,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2024-10-31 22:09:32,989 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:09:32,989 INFO L215 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-31 22:09:32,989 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-31 22:09:32,990 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 22:09:32,990 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:09:32,990 INFO L85 PathProgramCache]: Analyzing trace with hash -114059028, now seen corresponding path program 1 times [2024-10-31 22:09:32,991 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:09:32,991 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1732529840] [2024-10-31 22:09:32,992 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:09:32,992 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:09:33,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:09:42,169 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-31 22:09:42,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:09:42,177 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-31 22:09:42,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:09:42,183 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-31 22:09:42,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:09:42,190 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-31 22:09:42,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:09:42,197 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-10-31 22:09:42,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:09:42,203 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-31 22:09:42,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:09:42,211 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-31 22:09:42,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:09:42,217 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-31 22:09:42,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:09:42,224 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-10-31 22:09:42,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:09:42,230 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-10-31 22:09:42,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:09:42,238 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-10-31 22:09:42,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:09:42,245 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-31 22:09:42,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:09:42,253 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-31 22:09:42,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:09:42,261 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-31 22:09:42,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:09:42,269 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-10-31 22:09:42,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:09:42,277 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-10-31 22:09:42,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:09:42,284 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-10-31 22:09:42,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:09:42,292 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-10-31 22:09:42,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:09:42,300 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-10-31 22:09:42,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:09:42,307 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-10-31 22:09:42,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:09:42,315 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-10-31 22:09:42,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:09:42,322 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-10-31 22:09:42,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:09:42,330 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-10-31 22:09:42,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:09:42,338 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-10-31 22:09:42,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:09:42,346 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-10-31 22:09:42,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:09:42,355 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2024-10-31 22:09:42,356 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:09:42,356 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1732529840] [2024-10-31 22:09:42,356 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1732529840] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:09:42,357 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:09:42,357 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-10-31 22:09:42,357 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [823181613] [2024-10-31 22:09:42,357 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:09:42,358 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-10-31 22:09:42,358 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:09:42,359 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-10-31 22:09:42,359 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2024-10-31 22:09:42,360 INFO L87 Difference]: Start difference. First operand 135 states and 208 transitions. Second operand has 13 states, 13 states have (on average 3.6153846153846154) internal successors, (47), 13 states have internal predecessors, (47), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2024-10-31 22:09:48,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:09:48,112 INFO L93 Difference]: Finished difference Result 577 states and 890 transitions. [2024-10-31 22:09:48,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-31 22:09:48,113 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.6153846153846154) internal successors, (47), 13 states have internal predecessors, (47), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) Word has length 169 [2024-10-31 22:09:48,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:09:48,119 INFO L225 Difference]: With dead ends: 577 [2024-10-31 22:09:48,120 INFO L226 Difference]: Without dead ends: 445 [2024-10-31 22:09:48,121 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=106, Invalid=400, Unknown=0, NotChecked=0, Total=506 [2024-10-31 22:09:48,123 INFO L432 NwaCegarLoop]: 102 mSDtfsCounter, 459 mSDsluCounter, 569 mSDsCounter, 0 mSdLazyCounter, 862 mSolverCounterSat, 82 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 459 SdHoareTripleChecker+Valid, 671 SdHoareTripleChecker+Invalid, 944 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 82 IncrementalHoareTripleChecker+Valid, 862 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.8s IncrementalHoareTripleChecker+Time [2024-10-31 22:09:48,123 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [459 Valid, 671 Invalid, 944 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [82 Valid, 862 Invalid, 0 Unknown, 0 Unchecked, 3.8s Time] [2024-10-31 22:09:48,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 445 states. [2024-10-31 22:09:48,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 445 to 236. [2024-10-31 22:09:48,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 236 states, 175 states have (on average 1.4514285714285715) internal successors, (254), 176 states have internal predecessors, (254), 56 states have call successors, (56), 4 states have call predecessors, (56), 4 states have return successors, (56), 55 states have call predecessors, (56), 56 states have call successors, (56) [2024-10-31 22:09:48,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 366 transitions. [2024-10-31 22:09:48,173 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 366 transitions. Word has length 169 [2024-10-31 22:09:48,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:09:48,176 INFO L471 AbstractCegarLoop]: Abstraction has 236 states and 366 transitions. [2024-10-31 22:09:48,176 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.6153846153846154) internal successors, (47), 13 states have internal predecessors, (47), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2024-10-31 22:09:48,177 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 366 transitions. [2024-10-31 22:09:48,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2024-10-31 22:09:48,184 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:09:48,184 INFO L215 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-31 22:09:48,185 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-31 22:09:48,185 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 22:09:48,185 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:09:48,186 INFO L85 PathProgramCache]: Analyzing trace with hash 1559087423, now seen corresponding path program 1 times [2024-10-31 22:09:48,186 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:09:48,186 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1781078048] [2024-10-31 22:09:48,186 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:09:48,186 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:09:48,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:09:49,269 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-31 22:09:49,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:09:49,277 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-31 22:09:49,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:09:49,282 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-31 22:09:49,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:09:49,291 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-31 22:09:49,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:09:49,299 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-10-31 22:09:49,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:09:49,305 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-31 22:09:49,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:09:49,313 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-31 22:09:49,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:09:49,320 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-31 22:09:49,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:09:49,330 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-10-31 22:09:49,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:09:49,334 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-10-31 22:09:49,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:09:49,340 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-10-31 22:09:49,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:09:49,348 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-31 22:09:49,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:09:49,354 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-31 22:09:49,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:09:49,360 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-31 22:09:49,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:09:49,367 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-10-31 22:09:49,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:09:49,375 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-10-31 22:09:49,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:09:49,381 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-10-31 22:09:49,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:09:49,388 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-10-31 22:09:49,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:09:49,395 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-10-31 22:09:49,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:09:49,401 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-10-31 22:09:49,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:09:49,408 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-10-31 22:09:49,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:09:49,418 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-10-31 22:09:49,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:09:49,426 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-10-31 22:09:49,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:09:49,433 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-10-31 22:09:49,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:09:49,440 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-10-31 22:09:49,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:09:49,449 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2024-10-31 22:09:49,449 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:09:49,450 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1781078048] [2024-10-31 22:09:49,450 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1781078048] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:09:49,450 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:09:49,451 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-31 22:09:49,451 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [964874866] [2024-10-31 22:09:49,451 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:09:49,452 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-31 22:09:49,452 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:09:49,455 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-31 22:09:49,455 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-10-31 22:09:49,455 INFO L87 Difference]: Start difference. First operand 236 states and 366 transitions. Second operand has 8 states, 8 states have (on average 6.0) internal successors, (48), 8 states have internal predecessors, (48), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2024-10-31 22:09:50,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:09:50,442 INFO L93 Difference]: Finished difference Result 644 states and 995 transitions. [2024-10-31 22:09:50,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-31 22:09:50,443 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.0) internal successors, (48), 8 states have internal predecessors, (48), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) Word has length 170 [2024-10-31 22:09:50,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:09:50,452 INFO L225 Difference]: With dead ends: 644 [2024-10-31 22:09:50,455 INFO L226 Difference]: Without dead ends: 512 [2024-10-31 22:09:50,456 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2024-10-31 22:09:50,458 INFO L432 NwaCegarLoop]: 255 mSDtfsCounter, 309 mSDsluCounter, 865 mSDsCounter, 0 mSdLazyCounter, 438 mSolverCounterSat, 77 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 309 SdHoareTripleChecker+Valid, 1120 SdHoareTripleChecker+Invalid, 515 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 77 IncrementalHoareTripleChecker+Valid, 438 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-31 22:09:50,462 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [309 Valid, 1120 Invalid, 515 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [77 Valid, 438 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-31 22:09:50,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 512 states. [2024-10-31 22:09:50,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 512 to 268. [2024-10-31 22:09:50,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 268 states, 207 states have (on average 1.4830917874396135) internal successors, (307), 208 states have internal predecessors, (307), 56 states have call successors, (56), 4 states have call predecessors, (56), 4 states have return successors, (56), 55 states have call predecessors, (56), 56 states have call successors, (56) [2024-10-31 22:09:50,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 419 transitions. [2024-10-31 22:09:50,542 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 419 transitions. Word has length 170 [2024-10-31 22:09:50,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:09:50,545 INFO L471 AbstractCegarLoop]: Abstraction has 268 states and 419 transitions. [2024-10-31 22:09:50,545 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.0) internal successors, (48), 8 states have internal predecessors, (48), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2024-10-31 22:09:50,545 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 419 transitions. [2024-10-31 22:09:50,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2024-10-31 22:09:50,552 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:09:50,553 INFO L215 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-31 22:09:50,553 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-31 22:09:50,553 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 22:09:50,553 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:09:50,554 INFO L85 PathProgramCache]: Analyzing trace with hash 1300921985, now seen corresponding path program 1 times [2024-10-31 22:09:50,554 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:09:50,554 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [977289350] [2024-10-31 22:09:50,558 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:09:50,558 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:09:50,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:09:54,067 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-31 22:09:54,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:09:54,071 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-31 22:09:54,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:09:54,074 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-31 22:09:54,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:09:54,077 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-31 22:09:54,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:09:54,081 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-10-31 22:09:54,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:09:54,086 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-31 22:09:54,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:09:54,089 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-31 22:09:54,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:09:54,093 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-31 22:09:54,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:09:54,096 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-10-31 22:09:54,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:09:54,099 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-10-31 22:09:54,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:09:54,103 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-10-31 22:09:54,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:09:54,106 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-31 22:09:54,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:09:54,109 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-31 22:09:54,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:09:54,112 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-31 22:09:54,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:09:54,117 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-10-31 22:09:54,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:09:54,121 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-10-31 22:09:54,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:09:54,126 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-10-31 22:09:54,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:09:54,130 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-10-31 22:09:54,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:09:54,134 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-10-31 22:09:54,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:09:54,138 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-10-31 22:09:54,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:09:54,141 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-10-31 22:09:54,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:09:54,145 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-10-31 22:09:54,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:09:54,148 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-10-31 22:09:54,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:09:54,153 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-10-31 22:09:54,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:09:54,157 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-10-31 22:09:54,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:09:54,166 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2024-10-31 22:09:54,166 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:09:54,166 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [977289350] [2024-10-31 22:09:54,168 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [977289350] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:09:54,168 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:09:54,168 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-31 22:09:54,169 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [403357835] [2024-10-31 22:09:54,169 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:09:54,169 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-31 22:09:54,169 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:09:54,171 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-31 22:09:54,171 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-10-31 22:09:54,171 INFO L87 Difference]: Start difference. First operand 268 states and 419 transitions. Second operand has 8 states, 8 states have (on average 6.0) internal successors, (48), 8 states have internal predecessors, (48), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25)