./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-28.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_d8733314-46dc-427d-8605-e798cee0ec2f/bin/uautomizer-verify-4GaUIPS5ZU/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8733314-46dc-427d-8605-e798cee0ec2f/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_d8733314-46dc-427d-8605-e798cee0ec2f/bin/uautomizer-verify-4GaUIPS5ZU/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8733314-46dc-427d-8605-e798cee0ec2f/bin/uautomizer-verify-4GaUIPS5ZU/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-28.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8733314-46dc-427d-8605-e798cee0ec2f/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_d8733314-46dc-427d-8605-e798cee0ec2f/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 05976cf19c2340bbdfc64774c28749e3f9c87d6988a912aca41569d6eccee426 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4fc63b2 [2024-10-31 22:11:37,807 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-31 22:11:37,885 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8733314-46dc-427d-8605-e798cee0ec2f/bin/uautomizer-verify-4GaUIPS5ZU/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-31 22:11:37,890 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-31 22:11:37,891 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-31 22:11:37,930 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-31 22:11:37,931 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-31 22:11:37,931 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-31 22:11:37,933 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-31 22:11:37,934 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-31 22:11:37,935 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-31 22:11:37,935 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-31 22:11:37,936 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-31 22:11:37,937 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-31 22:11:37,939 INFO L153 SettingsManager]: * Use SBE=true [2024-10-31 22:11:37,940 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-31 22:11:37,940 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-31 22:11:37,940 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-31 22:11:37,941 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-31 22:11:37,941 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-31 22:11:37,941 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-31 22:11:37,946 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-31 22:11:37,946 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-31 22:11:37,947 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-31 22:11:37,947 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-31 22:11:37,948 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-31 22:11:37,948 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-31 22:11:37,948 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-31 22:11:37,949 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-31 22:11:37,949 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-31 22:11:37,949 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-31 22:11:37,949 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-31 22:11:37,950 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-31 22:11:37,950 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-31 22:11:37,950 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-31 22:11:37,950 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-31 22:11:37,951 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-31 22:11:37,951 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-31 22:11:37,951 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-31 22:11:37,951 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-31 22:11:37,952 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-31 22:11:37,953 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-31 22:11:37,954 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_d8733314-46dc-427d-8605-e798cee0ec2f/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_d8733314-46dc-427d-8605-e798cee0ec2f/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 -> 05976cf19c2340bbdfc64774c28749e3f9c87d6988a912aca41569d6eccee426 [2024-10-31 22:11:38,257 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-31 22:11:38,289 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-31 22:11:38,292 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-31 22:11:38,293 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-31 22:11:38,295 INFO L274 PluginConnector]: CDTParser initialized [2024-10-31 22:11:38,297 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8733314-46dc-427d-8605-e798cee0ec2f/bin/uautomizer-verify-4GaUIPS5ZU/../../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-28.i Unable to find full path for "g++" [2024-10-31 22:11:40,644 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-31 22:11:40,966 INFO L384 CDTParser]: Found 1 translation units. [2024-10-31 22:11:40,967 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8733314-46dc-427d-8605-e798cee0ec2f/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-28.i [2024-10-31 22:11:40,979 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8733314-46dc-427d-8605-e798cee0ec2f/bin/uautomizer-verify-4GaUIPS5ZU/data/d53c1c8b6/f8d4ba1c06d046efa72e410078239aea/FLAG72812277a [2024-10-31 22:11:41,008 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8733314-46dc-427d-8605-e798cee0ec2f/bin/uautomizer-verify-4GaUIPS5ZU/data/d53c1c8b6/f8d4ba1c06d046efa72e410078239aea [2024-10-31 22:11:41,016 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-31 22:11:41,021 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-31 22:11:41,023 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-31 22:11:41,023 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-31 22:11:41,030 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-31 22:11:41,031 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.10 10:11:41" (1/1) ... [2024-10-31 22:11:41,033 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@33fc5abe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:11:41, skipping insertion in model container [2024-10-31 22:11:41,034 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.10 10:11:41" (1/1) ... [2024-10-31 22:11:41,061 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-31 22:11:41,336 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_d8733314-46dc-427d-8605-e798cee0ec2f/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-28.i[916,929] [2024-10-31 22:11:41,419 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-31 22:11:41,442 INFO L200 MainTranslator]: Completed pre-run [2024-10-31 22:11:41,456 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_d8733314-46dc-427d-8605-e798cee0ec2f/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-28.i[916,929] [2024-10-31 22:11:41,502 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-31 22:11:41,532 INFO L204 MainTranslator]: Completed translation [2024-10-31 22:11:41,533 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:11:41 WrapperNode [2024-10-31 22:11:41,533 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-31 22:11:41,535 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-31 22:11:41,535 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-31 22:11:41,535 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-31 22:11:41,544 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:11:41" (1/1) ... [2024-10-31 22:11:41,556 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:11:41" (1/1) ... [2024-10-31 22:11:41,603 INFO L138 Inliner]: procedures = 26, calls = 31, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 138 [2024-10-31 22:11:41,607 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-31 22:11:41,608 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-31 22:11:41,608 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-31 22:11:41,608 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-31 22:11:41,627 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:11:41" (1/1) ... [2024-10-31 22:11:41,628 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:11:41" (1/1) ... [2024-10-31 22:11:41,635 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:11:41" (1/1) ... [2024-10-31 22:11:41,660 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:11:41,664 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:11:41" (1/1) ... [2024-10-31 22:11:41,664 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:11:41" (1/1) ... [2024-10-31 22:11:41,673 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:11:41" (1/1) ... [2024-10-31 22:11:41,678 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:11:41" (1/1) ... [2024-10-31 22:11:41,682 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:11:41" (1/1) ... [2024-10-31 22:11:41,687 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:11:41" (1/1) ... [2024-10-31 22:11:41,689 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-31 22:11:41,693 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-31 22:11:41,694 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-31 22:11:41,694 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-31 22:11:41,695 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:11:41" (1/1) ... [2024-10-31 22:11:41,702 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-31 22:11:41,716 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8733314-46dc-427d-8605-e798cee0ec2f/bin/uautomizer-verify-4GaUIPS5ZU/z3 [2024-10-31 22:11:41,730 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8733314-46dc-427d-8605-e798cee0ec2f/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:11:41,733 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8733314-46dc-427d-8605-e798cee0ec2f/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:11:41,762 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-31 22:11:41,763 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-31 22:11:41,763 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-31 22:11:41,763 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-31 22:11:41,763 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-31 22:11:41,763 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-31 22:11:41,846 INFO L238 CfgBuilder]: Building ICFG [2024-10-31 22:11:41,848 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-31 22:11:42,145 INFO L? ?]: Removed 14 outVars from TransFormulas that were not future-live. [2024-10-31 22:11:42,145 INFO L287 CfgBuilder]: Performing block encoding [2024-10-31 22:11:42,158 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-31 22:11:42,159 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-31 22:11:42,159 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.10 10:11:42 BoogieIcfgContainer [2024-10-31 22:11:42,159 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-31 22:11:42,162 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-31 22:11:42,162 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-31 22:11:42,166 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-31 22:11:42,166 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 31.10 10:11:41" (1/3) ... [2024-10-31 22:11:42,167 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1b807dce and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.10 10:11:42, skipping insertion in model container [2024-10-31 22:11:42,167 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:11:41" (2/3) ... [2024-10-31 22:11:42,167 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1b807dce and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.10 10:11:42, skipping insertion in model container [2024-10-31 22:11:42,168 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.10 10:11:42" (3/3) ... [2024-10-31 22:11:42,169 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_floatingpointinfluence_no-floats_file-28.i [2024-10-31 22:11:42,188 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-31 22:11:42,189 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-31 22:11:42,262 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-31 22:11:42,269 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;@4244cf8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-31 22:11:42,270 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-31 22:11:42,278 INFO L276 IsEmpty]: Start isEmpty. Operand has 60 states, 39 states have (on average 1.3333333333333333) internal successors, (52), 40 states have internal predecessors, (52), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-10-31 22:11:42,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-10-31 22:11:42,296 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:11:42,297 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:11:42,298 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 22:11:42,304 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:11:42,305 INFO L85 PathProgramCache]: Analyzing trace with hash -1007460807, now seen corresponding path program 1 times [2024-10-31 22:11:42,315 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:11:42,316 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1551898741] [2024-10-31 22:11:42,316 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:11:42,317 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:11:42,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:11:42,621 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-31 22:11:42,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:11:42,638 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-31 22:11:42,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:11:42,649 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-31 22:11:42,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:11:42,661 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-31 22:11:42,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:11:42,672 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-10-31 22:11:42,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:11:42,681 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-31 22:11:42,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:11:42,687 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-31 22:11:42,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:11:42,693 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-31 22:11:42,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:11:42,702 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-10-31 22:11:42,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:11:42,710 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-10-31 22:11:42,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:11:42,727 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-10-31 22:11:42,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:11:42,735 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-31 22:11:42,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:11:42,746 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-31 22:11:42,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:11:42,755 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-31 22:11:42,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:11:42,769 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-10-31 22:11:42,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:11:42,778 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-10-31 22:11:42,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:11:42,788 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-10-31 22:11:42,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:11:42,797 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-31 22:11:42,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:11:42,806 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-10-31 22:11:42,807 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:11:42,807 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1551898741] [2024-10-31 22:11:42,808 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1551898741] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:11:42,808 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:11:42,809 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-31 22:11:42,812 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1809214551] [2024-10-31 22:11:42,813 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:11:42,818 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-31 22:11:42,820 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:11:42,852 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-31 22:11:42,852 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-31 22:11:42,855 INFO L87 Difference]: Start difference. First operand has 60 states, 39 states have (on average 1.3333333333333333) internal successors, (52), 40 states have internal predecessors, (52), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) Second operand has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2024-10-31 22:11:42,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:11:42,900 INFO L93 Difference]: Finished difference Result 113 states and 188 transitions. [2024-10-31 22:11:42,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-31 22:11:42,903 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) Word has length 116 [2024-10-31 22:11:42,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:11:42,913 INFO L225 Difference]: With dead ends: 113 [2024-10-31 22:11:42,914 INFO L226 Difference]: Without dead ends: 56 [2024-10-31 22:11:42,918 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 56 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:11:42,925 INFO L432 NwaCegarLoop]: 79 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, 79 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:11:42,926 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-31 22:11:42,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2024-10-31 22:11:42,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2024-10-31 22:11:42,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 36 states have (on average 1.1944444444444444) internal successors, (43), 36 states have internal predecessors, (43), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-10-31 22:11:42,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 79 transitions. [2024-10-31 22:11:42,991 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 79 transitions. Word has length 116 [2024-10-31 22:11:42,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:11:42,992 INFO L471 AbstractCegarLoop]: Abstraction has 56 states and 79 transitions. [2024-10-31 22:11:42,994 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2024-10-31 22:11:42,995 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 79 transitions. [2024-10-31 22:11:42,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-10-31 22:11:42,998 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:11:42,998 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:11:42,998 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-31 22:11:42,999 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 22:11:42,999 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:11:43,000 INFO L85 PathProgramCache]: Analyzing trace with hash 2128078073, now seen corresponding path program 1 times [2024-10-31 22:11:43,000 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:11:43,000 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1167210973] [2024-10-31 22:11:43,000 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:11:43,001 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:11:43,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:11:43,429 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-31 22:11:43,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:11:43,453 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-31 22:11:43,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:11:43,459 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-31 22:11:43,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:11:43,463 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-31 22:11:43,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:11:43,469 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-10-31 22:11:43,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:11:43,473 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-31 22:11:43,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:11:43,480 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-31 22:11:43,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:11:43,487 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-31 22:11:43,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:11:43,490 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-10-31 22:11:43,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:11:43,494 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-10-31 22:11:43,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:11:43,497 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-10-31 22:11:43,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:11:43,501 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-31 22:11:43,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:11:43,504 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-31 22:11:43,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:11:43,511 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-31 22:11:43,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:11:43,517 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-10-31 22:11:43,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:11:43,521 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-10-31 22:11:43,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:11:43,525 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-10-31 22:11:43,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:11:43,537 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-31 22:11:43,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:11:43,541 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-10-31 22:11:43,542 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:11:43,542 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1167210973] [2024-10-31 22:11:43,542 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1167210973] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:11:43,542 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:11:43,543 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-31 22:11:43,543 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [442989813] [2024-10-31 22:11:43,543 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:11:43,547 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-31 22:11:43,548 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:11:43,549 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-31 22:11:43,550 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-31 22:11:43,550 INFO L87 Difference]: Start difference. First operand 56 states and 79 transitions. Second operand has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-10-31 22:11:43,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:11:43,733 INFO L93 Difference]: Finished difference Result 143 states and 199 transitions. [2024-10-31 22:11:43,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-31 22:11:43,734 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 116 [2024-10-31 22:11:43,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:11:43,736 INFO L225 Difference]: With dead ends: 143 [2024-10-31 22:11:43,736 INFO L226 Difference]: Without dead ends: 90 [2024-10-31 22:11:43,737 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-31 22:11:43,738 INFO L432 NwaCegarLoop]: 102 mSDtfsCounter, 66 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 162 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-31 22:11:43,739 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 162 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-31 22:11:43,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2024-10-31 22:11:43,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 87. [2024-10-31 22:11:43,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 60 states have (on average 1.1833333333333333) internal successors, (71), 61 states have internal predecessors, (71), 24 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 23 states have call predecessors, (24), 24 states have call successors, (24) [2024-10-31 22:11:43,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 119 transitions. [2024-10-31 22:11:43,756 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 119 transitions. Word has length 116 [2024-10-31 22:11:43,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:11:43,757 INFO L471 AbstractCegarLoop]: Abstraction has 87 states and 119 transitions. [2024-10-31 22:11:43,757 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-10-31 22:11:43,758 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 119 transitions. [2024-10-31 22:11:43,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-10-31 22:11:43,760 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:11:43,760 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:11:43,760 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-31 22:11:43,760 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 22:11:43,761 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:11:43,761 INFO L85 PathProgramCache]: Analyzing trace with hash 1869912635, now seen corresponding path program 1 times [2024-10-31 22:11:43,761 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:11:43,761 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1131415114] [2024-10-31 22:11:43,762 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:11:43,762 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:11:43,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:11:45,616 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-31 22:11:45,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:11:45,619 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-31 22:11:45,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:11:45,623 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-31 22:11:45,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:11:45,626 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-31 22:11:45,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:11:45,629 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-10-31 22:11:45,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:11:45,632 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-31 22:11:45,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:11:45,635 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-31 22:11:45,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:11:45,638 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-31 22:11:45,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:11:45,641 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-10-31 22:11:45,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:11:45,644 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-10-31 22:11:45,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:11:45,647 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-10-31 22:11:45,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:11:45,650 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-31 22:11:45,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:11:45,653 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-31 22:11:45,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:11:45,656 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-31 22:11:45,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:11:45,658 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-10-31 22:11:45,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:11:45,661 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-10-31 22:11:45,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:11:45,665 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-10-31 22:11:45,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:11:45,668 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-31 22:11:45,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:11:45,671 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-10-31 22:11:45,671 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:11:45,672 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1131415114] [2024-10-31 22:11:45,672 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1131415114] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:11:45,672 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:11:45,672 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-31 22:11:45,672 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [597681863] [2024-10-31 22:11:45,673 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:11:45,673 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-31 22:11:45,673 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:11:45,674 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-31 22:11:45,674 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-10-31 22:11:45,674 INFO L87 Difference]: Start difference. First operand 87 states and 119 transitions. Second operand has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 6 states have internal predecessors, (29), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-10-31 22:11:46,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:11:46,102 INFO L93 Difference]: Finished difference Result 194 states and 266 transitions. [2024-10-31 22:11:46,102 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-31 22:11:46,102 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 6 states have internal predecessors, (29), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 116 [2024-10-31 22:11:46,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:11:46,106 INFO L225 Difference]: With dead ends: 194 [2024-10-31 22:11:46,106 INFO L226 Difference]: Without dead ends: 110 [2024-10-31 22:11:46,107 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-10-31 22:11:46,108 INFO L432 NwaCegarLoop]: 106 mSDtfsCounter, 73 mSDsluCounter, 170 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 276 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-31 22:11:46,109 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 276 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-31 22:11:46,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2024-10-31 22:11:46,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 107. [2024-10-31 22:11:46,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 69 states have (on average 1.144927536231884) internal successors, (79), 71 states have internal predecessors, (79), 34 states have call successors, (34), 3 states have call predecessors, (34), 3 states have return successors, (34), 32 states have call predecessors, (34), 34 states have call successors, (34) [2024-10-31 22:11:46,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 147 transitions. [2024-10-31 22:11:46,143 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 147 transitions. Word has length 116 [2024-10-31 22:11:46,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:11:46,144 INFO L471 AbstractCegarLoop]: Abstraction has 107 states and 147 transitions. [2024-10-31 22:11:46,144 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 6 states have internal predecessors, (29), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-10-31 22:11:46,145 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 147 transitions. [2024-10-31 22:11:46,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2024-10-31 22:11:46,150 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:11:46,150 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:11:46,151 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-31 22:11:46,151 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 22:11:46,151 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:11:46,151 INFO L85 PathProgramCache]: Analyzing trace with hash 180128188, now seen corresponding path program 1 times [2024-10-31 22:11:46,152 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:11:46,152 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1088636457] [2024-10-31 22:11:46,152 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:11:46,152 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:11:46,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:11:47,354 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-31 22:11:47,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:11:47,357 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-31 22:11:47,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:11:47,360 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-31 22:11:47,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:11:47,362 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-31 22:11:47,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:11:47,365 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-10-31 22:11:47,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:11:47,368 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-31 22:11:47,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:11:47,370 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-31 22:11:47,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:11:47,373 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-31 22:11:47,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:11:47,376 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-10-31 22:11:47,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:11:47,378 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-10-31 22:11:47,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:11:47,381 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-10-31 22:11:47,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:11:47,384 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-31 22:11:47,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:11:47,386 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-31 22:11:47,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:11:47,389 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-31 22:11:47,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:11:47,391 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-10-31 22:11:47,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:11:47,394 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-10-31 22:11:47,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:11:47,396 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-10-31 22:11:47,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:11:47,399 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-31 22:11:47,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:11:47,402 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-10-31 22:11:47,403 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:11:47,403 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1088636457] [2024-10-31 22:11:47,403 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1088636457] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:11:47,403 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:11:47,403 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-31 22:11:47,403 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1467595180] [2024-10-31 22:11:47,404 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:11:47,404 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-31 22:11:47,404 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:11:47,405 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-31 22:11:47,405 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-10-31 22:11:47,405 INFO L87 Difference]: Start difference. First operand 107 states and 147 transitions. Second operand has 7 states, 7 states have (on average 4.428571428571429) internal successors, (31), 7 states have internal predecessors, (31), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-10-31 22:11:47,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:11:47,850 INFO L93 Difference]: Finished difference Result 204 states and 277 transitions. [2024-10-31 22:11:47,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-31 22:11:47,851 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.428571428571429) internal successors, (31), 7 states have internal predecessors, (31), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 118 [2024-10-31 22:11:47,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:11:47,854 INFO L225 Difference]: With dead ends: 204 [2024-10-31 22:11:47,854 INFO L226 Difference]: Without dead ends: 110 [2024-10-31 22:11:47,855 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-10-31 22:11:47,856 INFO L432 NwaCegarLoop]: 99 mSDtfsCounter, 38 mSDsluCounter, 292 mSDsCounter, 0 mSdLazyCounter, 122 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 391 SdHoareTripleChecker+Invalid, 135 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 122 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-31 22:11:47,860 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 391 Invalid, 135 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 122 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-31 22:11:47,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2024-10-31 22:11:47,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 107. [2024-10-31 22:11:47,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 69 states have (on average 1.1304347826086956) internal successors, (78), 71 states have internal predecessors, (78), 34 states have call successors, (34), 3 states have call predecessors, (34), 3 states have return successors, (34), 32 states have call predecessors, (34), 34 states have call successors, (34) [2024-10-31 22:11:47,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 146 transitions. [2024-10-31 22:11:47,889 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 146 transitions. Word has length 118 [2024-10-31 22:11:47,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:11:47,890 INFO L471 AbstractCegarLoop]: Abstraction has 107 states and 146 transitions. [2024-10-31 22:11:47,890 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.428571428571429) internal successors, (31), 7 states have internal predecessors, (31), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-10-31 22:11:47,890 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 146 transitions. [2024-10-31 22:11:47,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2024-10-31 22:11:47,896 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:11:47,896 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:11:47,896 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-31 22:11:47,897 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 22:11:47,897 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:11:47,897 INFO L85 PathProgramCache]: Analyzing trace with hash 855559414, now seen corresponding path program 1 times [2024-10-31 22:11:47,897 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:11:47,898 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2025462091] [2024-10-31 22:11:47,898 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:11:47,902 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:11:47,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:11:51,291 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-31 22:11:51,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:11:51,295 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-31 22:11:51,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:11:51,299 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-31 22:11:51,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:11:51,303 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-31 22:11:51,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:11:51,309 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-10-31 22:11:51,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:11:51,314 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-31 22:11:51,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:11:51,318 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-31 22:11:51,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:11:51,321 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-31 22:11:51,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:11:51,325 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-10-31 22:11:51,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:11:51,329 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-10-31 22:11:51,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:11:51,335 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-10-31 22:11:51,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:11:51,339 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-31 22:11:51,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:11:51,349 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-31 22:11:51,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:11:51,352 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-31 22:11:51,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:11:51,360 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-10-31 22:11:51,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:11:51,364 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-10-31 22:11:51,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:11:51,367 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-10-31 22:11:51,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:11:51,370 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-31 22:11:51,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:11:51,374 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-10-31 22:11:51,375 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:11:51,375 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2025462091] [2024-10-31 22:11:51,377 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2025462091] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:11:51,377 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:11:51,377 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-31 22:11:51,378 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [994904638] [2024-10-31 22:11:51,378 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:11:51,380 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-31 22:11:51,381 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:11:51,382 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-31 22:11:51,382 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-10-31 22:11:51,382 INFO L87 Difference]: Start difference. First operand 107 states and 146 transitions. Second operand has 10 states, 10 states have (on average 3.1) internal successors, (31), 10 states have internal predecessors, (31), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-10-31 22:11:52,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:11:52,219 INFO L93 Difference]: Finished difference Result 147 states and 189 transitions. [2024-10-31 22:11:52,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-31 22:11:52,222 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.1) internal successors, (31), 10 states have internal predecessors, (31), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 118 [2024-10-31 22:11:52,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:11:52,224 INFO L225 Difference]: With dead ends: 147 [2024-10-31 22:11:52,226 INFO L226 Difference]: Without dead ends: 145 [2024-10-31 22:11:52,227 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=42, Invalid=140, Unknown=0, NotChecked=0, Total=182 [2024-10-31 22:11:52,228 INFO L432 NwaCegarLoop]: 79 mSDtfsCounter, 64 mSDsluCounter, 443 mSDsCounter, 0 mSdLazyCounter, 238 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 522 SdHoareTripleChecker+Invalid, 238 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 238 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-31 22:11:52,228 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 522 Invalid, 238 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 238 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-31 22:11:52,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2024-10-31 22:11:52,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 124. [2024-10-31 22:11:52,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 84 states have (on average 1.130952380952381) internal successors, (95), 86 states have internal predecessors, (95), 34 states have call successors, (34), 5 states have call predecessors, (34), 5 states have return successors, (34), 32 states have call predecessors, (34), 34 states have call successors, (34) [2024-10-31 22:11:52,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 163 transitions. [2024-10-31 22:11:52,265 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 163 transitions. Word has length 118 [2024-10-31 22:11:52,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:11:52,266 INFO L471 AbstractCegarLoop]: Abstraction has 124 states and 163 transitions. [2024-10-31 22:11:52,266 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.1) internal successors, (31), 10 states have internal predecessors, (31), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-10-31 22:11:52,266 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 163 transitions. [2024-10-31 22:11:52,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2024-10-31 22:11:52,268 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:11:52,268 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:11:52,268 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-31 22:11:52,268 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 22:11:52,269 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:11:52,269 INFO L85 PathProgramCache]: Analyzing trace with hash 1535617784, now seen corresponding path program 1 times [2024-10-31 22:11:52,269 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:11:52,269 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [267199073] [2024-10-31 22:11:52,269 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:11:52,270 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:11:52,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:11:55,054 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-31 22:11:55,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:11:55,058 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-31 22:11:55,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:11:55,061 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-31 22:11:55,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:11:55,065 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-31 22:11:55,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:11:55,069 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-10-31 22:11:55,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:11:55,073 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-31 22:11:55,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:11:55,081 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-31 22:11:55,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:11:55,085 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-31 22:11:55,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:11:55,090 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-10-31 22:11:55,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:11:55,093 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-10-31 22:11:55,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:11:55,098 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-10-31 22:11:55,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:11:55,101 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-31 22:11:55,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:11:55,105 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-31 22:11:55,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:11:55,108 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-31 22:11:55,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:11:55,114 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-10-31 22:11:55,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:11:55,117 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-10-31 22:11:55,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:11:55,120 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-10-31 22:11:55,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:11:55,126 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-31 22:11:55,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:11:55,130 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-10-31 22:11:55,132 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:11:55,133 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [267199073] [2024-10-31 22:11:55,133 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [267199073] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:11:55,133 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:11:55,133 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-31 22:11:55,134 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1359473168] [2024-10-31 22:11:55,134 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:11:55,134 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-31 22:11:55,134 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:11:55,136 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-31 22:11:55,137 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-10-31 22:11:55,137 INFO L87 Difference]: Start difference. First operand 124 states and 163 transitions. Second operand has 10 states, 10 states have (on average 3.1) internal successors, (31), 10 states have internal predecessors, (31), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-10-31 22:11:55,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:11:55,893 INFO L93 Difference]: Finished difference Result 154 states and 197 transitions. [2024-10-31 22:11:55,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-31 22:11:55,894 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.1) internal successors, (31), 10 states have internal predecessors, (31), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 118 [2024-10-31 22:11:55,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:11:55,897 INFO L225 Difference]: With dead ends: 154 [2024-10-31 22:11:55,899 INFO L226 Difference]: Without dead ends: 152 [2024-10-31 22:11:55,899 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=42, Invalid=140, Unknown=0, NotChecked=0, Total=182 [2024-10-31 22:11:55,900 INFO L432 NwaCegarLoop]: 99 mSDtfsCounter, 64 mSDsluCounter, 563 mSDsCounter, 0 mSdLazyCounter, 334 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 662 SdHoareTripleChecker+Invalid, 334 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 334 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-31 22:11:55,901 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 662 Invalid, 334 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 334 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-31 22:11:55,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2024-10-31 22:11:55,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 124. [2024-10-31 22:11:55,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 84 states have (on average 1.130952380952381) internal successors, (95), 86 states have internal predecessors, (95), 34 states have call successors, (34), 5 states have call predecessors, (34), 5 states have return successors, (34), 32 states have call predecessors, (34), 34 states have call successors, (34) [2024-10-31 22:11:55,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 163 transitions. [2024-10-31 22:11:55,940 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 163 transitions. Word has length 118 [2024-10-31 22:11:55,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:11:55,941 INFO L471 AbstractCegarLoop]: Abstraction has 124 states and 163 transitions. [2024-10-31 22:11:55,942 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.1) internal successors, (31), 10 states have internal predecessors, (31), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-10-31 22:11:55,942 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 163 transitions. [2024-10-31 22:11:55,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2024-10-31 22:11:55,944 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:11:55,944 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:11:55,948 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-31 22:11:55,948 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 22:11:55,949 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:11:55,949 INFO L85 PathProgramCache]: Analyzing trace with hash -1795480909, now seen corresponding path program 1 times [2024-10-31 22:11:55,949 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:11:55,949 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1011168150] [2024-10-31 22:11:55,949 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:11:55,950 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:11:55,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:11:56,034 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-31 22:11:56,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:11:56,040 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-31 22:11:56,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:11:56,043 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-31 22:11:56,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:11:56,048 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-31 22:11:56,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:11:56,057 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-10-31 22:11:56,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:11:56,059 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-31 22:11:56,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:11:56,067 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-31 22:11:56,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:11:56,070 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-31 22:11:56,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:11:56,072 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-10-31 22:11:56,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:11:56,078 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-10-31 22:11:56,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:11:56,081 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-10-31 22:11:56,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:11:56,083 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-31 22:11:56,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:11:56,087 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-31 22:11:56,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:11:56,092 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-31 22:11:56,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:11:56,098 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-10-31 22:11:56,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:11:56,101 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-10-31 22:11:56,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:11:56,103 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-10-31 22:11:56,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:11:56,109 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-31 22:11:56,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:11:56,112 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-10-31 22:11:56,116 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:11:56,116 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1011168150] [2024-10-31 22:11:56,116 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1011168150] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:11:56,117 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:11:56,117 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-31 22:11:56,117 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [187686099] [2024-10-31 22:11:56,117 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:11:56,118 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-31 22:11:56,118 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:11:56,118 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-31 22:11:56,118 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 22:11:56,119 INFO L87 Difference]: Start difference. First operand 124 states and 163 transitions. Second operand has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-10-31 22:11:56,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:11:56,219 INFO L93 Difference]: Finished difference Result 261 states and 337 transitions. [2024-10-31 22:11:56,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-31 22:11:56,220 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 120 [2024-10-31 22:11:56,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:11:56,222 INFO L225 Difference]: With dead ends: 261 [2024-10-31 22:11:56,222 INFO L226 Difference]: Without dead ends: 150 [2024-10-31 22:11:56,223 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 22:11:56,224 INFO L432 NwaCegarLoop]: 92 mSDtfsCounter, 28 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 151 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-31 22:11:56,224 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 151 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-31 22:11:56,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2024-10-31 22:11:56,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 147. [2024-10-31 22:11:56,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 147 states, 99 states have (on average 1.1111111111111112) internal successors, (110), 102 states have internal predecessors, (110), 40 states have call successors, (40), 7 states have call predecessors, (40), 7 states have return successors, (40), 37 states have call predecessors, (40), 40 states have call successors, (40) [2024-10-31 22:11:56,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 190 transitions. [2024-10-31 22:11:56,268 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 190 transitions. Word has length 120 [2024-10-31 22:11:56,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:11:56,269 INFO L471 AbstractCegarLoop]: Abstraction has 147 states and 190 transitions. [2024-10-31 22:11:56,269 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-10-31 22:11:56,269 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 190 transitions. [2024-10-31 22:11:56,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2024-10-31 22:11:56,271 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:11:56,271 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:11:56,271 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-31 22:11:56,272 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 22:11:56,272 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:11:56,272 INFO L85 PathProgramCache]: Analyzing trace with hash 1491412089, now seen corresponding path program 1 times [2024-10-31 22:11:56,273 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:11:56,273 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1259582349] [2024-10-31 22:11:56,273 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:11:56,273 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:11:56,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:11:56,334 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-31 22:11:56,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:11:56,336 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-31 22:11:56,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:11:56,339 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-31 22:11:56,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:11:56,341 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-31 22:11:56,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:11:56,343 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-10-31 22:11:56,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:11:56,346 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-31 22:11:56,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:11:56,348 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-31 22:11:56,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:11:56,350 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-31 22:11:56,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:11:56,353 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-10-31 22:11:56,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:11:56,355 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-10-31 22:11:56,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:11:56,358 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-10-31 22:11:56,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:11:56,360 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-31 22:11:56,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:11:56,362 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-31 22:11:56,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:11:56,365 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-31 22:11:56,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:11:56,368 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-10-31 22:11:56,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:11:56,370 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-10-31 22:11:56,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:11:56,373 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-10-31 22:11:56,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:11:56,375 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-31 22:11:56,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:11:56,378 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-10-31 22:11:56,378 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:11:56,378 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1259582349] [2024-10-31 22:11:56,379 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1259582349] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:11:56,379 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:11:56,379 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-31 22:11:56,379 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1588872887] [2024-10-31 22:11:56,379 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:11:56,380 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-31 22:11:56,380 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:11:56,380 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-31 22:11:56,380 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 22:11:56,381 INFO L87 Difference]: Start difference. First operand 147 states and 190 transitions. Second operand has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-10-31 22:11:56,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:11:56,450 INFO L93 Difference]: Finished difference Result 286 states and 363 transitions. [2024-10-31 22:11:56,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-31 22:11:56,450 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 120 [2024-10-31 22:11:56,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:11:56,452 INFO L225 Difference]: With dead ends: 286 [2024-10-31 22:11:56,452 INFO L226 Difference]: Without dead ends: 152 [2024-10-31 22:11:56,453 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 22:11:56,453 INFO L432 NwaCegarLoop]: 80 mSDtfsCounter, 32 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 133 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.0s IncrementalHoareTripleChecker+Time [2024-10-31 22:11:56,454 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 133 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-31 22:11:56,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2024-10-31 22:11:56,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 132. [2024-10-31 22:11:56,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 90 states have (on average 1.1) internal successors, (99), 92 states have internal predecessors, (99), 34 states have call successors, (34), 7 states have call predecessors, (34), 7 states have return successors, (34), 32 states have call predecessors, (34), 34 states have call successors, (34) [2024-10-31 22:11:56,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 167 transitions. [2024-10-31 22:11:56,478 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 167 transitions. Word has length 120 [2024-10-31 22:11:56,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:11:56,479 INFO L471 AbstractCegarLoop]: Abstraction has 132 states and 167 transitions. [2024-10-31 22:11:56,479 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-10-31 22:11:56,479 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 167 transitions. [2024-10-31 22:11:56,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2024-10-31 22:11:56,481 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:11:56,481 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:11:56,481 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-31 22:11:56,482 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 22:11:56,482 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:11:56,482 INFO L85 PathProgramCache]: Analyzing trace with hash 1674406324, now seen corresponding path program 1 times [2024-10-31 22:11:56,482 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:11:56,482 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [545789489] [2024-10-31 22:11:56,483 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:11:56,483 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:11:56,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:11:56,676 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-31 22:11:56,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:11:56,678 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-31 22:11:56,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:11:56,681 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-31 22:11:56,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:11:56,683 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-31 22:11:56,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:11:56,685 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-10-31 22:11:56,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:11:56,688 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-31 22:11:56,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:11:56,690 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-31 22:11:56,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:11:56,714 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-31 22:11:56,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:11:56,718 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-10-31 22:11:56,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:11:56,722 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-10-31 22:11:56,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:11:56,728 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-10-31 22:11:56,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:11:56,732 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-31 22:11:56,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:11:56,735 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-31 22:11:56,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:11:56,739 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-31 22:11:56,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:11:56,744 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-10-31 22:11:56,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:11:56,748 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-10-31 22:11:56,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:11:56,754 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-10-31 22:11:56,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:11:56,761 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-31 22:11:56,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:11:56,766 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 18 proven. 33 refuted. 0 times theorem prover too weak. 561 trivial. 0 not checked. [2024-10-31 22:11:56,768 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:11:56,768 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [545789489] [2024-10-31 22:11:56,768 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [545789489] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-31 22:11:56,768 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [423921825] [2024-10-31 22:11:56,769 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:11:56,769 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-31 22:11:56,769 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8733314-46dc-427d-8605-e798cee0ec2f/bin/uautomizer-verify-4GaUIPS5ZU/z3 [2024-10-31 22:11:56,771 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8733314-46dc-427d-8605-e798cee0ec2f/bin/uautomizer-verify-4GaUIPS5ZU/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-31 22:11:56,773 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8733314-46dc-427d-8605-e798cee0ec2f/bin/uautomizer-verify-4GaUIPS5ZU/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-31 22:11:56,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:11:56,891 INFO L255 TraceCheckSpWp]: Trace formula consists of 286 conjuncts, 32 conjuncts are in the unsatisfiable core [2024-10-31 22:11:56,912 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-31 22:12:01,763 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 126 proven. 167 refuted. 0 times theorem prover too weak. 319 trivial. 0 not checked. [2024-10-31 22:12:01,763 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-31 22:12:07,253 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 12 proven. 39 refuted. 0 times theorem prover too weak. 561 trivial. 0 not checked. [2024-10-31 22:12:07,254 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [423921825] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-31 22:12:07,254 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-31 22:12:07,254 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 16, 13] total 28 [2024-10-31 22:12:07,254 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1103070560] [2024-10-31 22:12:07,254 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-31 22:12:07,255 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2024-10-31 22:12:07,255 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:12:07,258 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2024-10-31 22:12:07,259 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=637, Unknown=0, NotChecked=0, Total=756 [2024-10-31 22:12:07,259 INFO L87 Difference]: Start difference. First operand 132 states and 167 transitions. Second operand has 28 states, 28 states have (on average 3.3214285714285716) internal successors, (93), 28 states have internal predecessors, (93), 4 states have call successors, (46), 3 states have call predecessors, (46), 6 states have return successors, (48), 4 states have call predecessors, (48), 4 states have call successors, (48)