./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-32.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 0e0057cc Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4e2ee14-cabc-41d1-8098-6e58d93b95ed/bin/uautomizer-verify-BQ2R08f2Ya/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4e2ee14-cabc-41d1-8098-6e58d93b95ed/bin/uautomizer-verify-BQ2R08f2Ya/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4e2ee14-cabc-41d1-8098-6e58d93b95ed/bin/uautomizer-verify-BQ2R08f2Ya/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4e2ee14-cabc-41d1-8098-6e58d93b95ed/bin/uautomizer-verify-BQ2R08f2Ya/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-32.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4e2ee14-cabc-41d1-8098-6e58d93b95ed/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4e2ee14-cabc-41d1-8098-6e58d93b95ed/bin/uautomizer-verify-BQ2R08f2Ya --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 4c0ba744090c8142a33dba842cf98027b64f47a633efca28c0047c8830fe4fa5 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-28 20:20:58,392 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-28 20:20:58,457 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4e2ee14-cabc-41d1-8098-6e58d93b95ed/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-11-28 20:20:58,461 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-28 20:20:58,461 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-28 20:20:58,486 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-28 20:20:58,486 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-28 20:20:58,487 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-28 20:20:58,488 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-28 20:20:58,488 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-28 20:20:58,489 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-28 20:20:58,489 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-28 20:20:58,490 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-28 20:20:58,490 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-28 20:20:58,491 INFO L153 SettingsManager]: * Use SBE=true [2023-11-28 20:20:58,491 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-28 20:20:58,492 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-28 20:20:58,492 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-28 20:20:58,493 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-28 20:20:58,493 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-28 20:20:58,494 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-28 20:20:58,494 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-28 20:20:58,495 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-28 20:20:58,495 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-28 20:20:58,496 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-28 20:20:58,496 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-28 20:20:58,496 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-28 20:20:58,497 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-28 20:20:58,497 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-28 20:20:58,498 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-28 20:20:58,498 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-28 20:20:58,499 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-28 20:20:58,499 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-28 20:20:58,499 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-28 20:20:58,500 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-28 20:20:58,500 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-28 20:20:58,500 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-28 20:20:58,500 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-28 20:20:58,500 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-28 20:20:58,501 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-28 20:20:58,501 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-28 20:20:58,501 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-28 20:20:58,501 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_c4e2ee14-cabc-41d1-8098-6e58d93b95ed/bin/uautomizer-verify-BQ2R08f2Ya/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_c4e2ee14-cabc-41d1-8098-6e58d93b95ed/bin/uautomizer-verify-BQ2R08f2Ya 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 -> 4c0ba744090c8142a33dba842cf98027b64f47a633efca28c0047c8830fe4fa5 [2023-11-28 20:20:58,716 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-28 20:20:58,744 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-28 20:20:58,746 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-28 20:20:58,748 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-28 20:20:58,748 INFO L274 PluginConnector]: CDTParser initialized [2023-11-28 20:20:58,749 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4e2ee14-cabc-41d1-8098-6e58d93b95ed/bin/uautomizer-verify-BQ2R08f2Ya/../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-32.i [2023-11-28 20:21:01,600 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-28 20:21:01,801 INFO L384 CDTParser]: Found 1 translation units. [2023-11-28 20:21:01,801 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4e2ee14-cabc-41d1-8098-6e58d93b95ed/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-32.i [2023-11-28 20:21:01,811 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4e2ee14-cabc-41d1-8098-6e58d93b95ed/bin/uautomizer-verify-BQ2R08f2Ya/data/86d9568ff/597abed11ddb48bd8955359765441648/FLAGd9f6e5462 [2023-11-28 20:21:01,827 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4e2ee14-cabc-41d1-8098-6e58d93b95ed/bin/uautomizer-verify-BQ2R08f2Ya/data/86d9568ff/597abed11ddb48bd8955359765441648 [2023-11-28 20:21:01,830 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-28 20:21:01,831 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-28 20:21:01,833 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-28 20:21:01,833 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-28 20:21:01,839 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-28 20:21:01,840 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 08:21:01" (1/1) ... [2023-11-28 20:21:01,841 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4d59ab60 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:21:01, skipping insertion in model container [2023-11-28 20:21:01,841 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 08:21:01" (1/1) ... [2023-11-28 20:21:01,877 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-28 20:21:02,034 WARN L240 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_c4e2ee14-cabc-41d1-8098-6e58d93b95ed/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-32.i[916,929] [2023-11-28 20:21:02,094 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-28 20:21:02,104 INFO L202 MainTranslator]: Completed pre-run [2023-11-28 20:21:02,117 WARN L240 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_c4e2ee14-cabc-41d1-8098-6e58d93b95ed/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-32.i[916,929] [2023-11-28 20:21:02,151 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-28 20:21:02,168 INFO L206 MainTranslator]: Completed translation [2023-11-28 20:21:02,169 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:21:02 WrapperNode [2023-11-28 20:21:02,169 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-28 20:21:02,170 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-28 20:21:02,170 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-28 20:21:02,170 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-28 20:21:02,177 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:21:02" (1/1) ... [2023-11-28 20:21:02,192 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:21:02" (1/1) ... [2023-11-28 20:21:02,233 INFO L138 Inliner]: procedures = 26, calls = 158, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 386 [2023-11-28 20:21:02,234 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-28 20:21:02,235 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-28 20:21:02,235 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-28 20:21:02,235 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-28 20:21:02,246 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:21:02" (1/1) ... [2023-11-28 20:21:02,246 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:21:02" (1/1) ... [2023-11-28 20:21:02,253 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:21:02" (1/1) ... [2023-11-28 20:21:02,274 INFO L175 MemorySlicer]: Split 124 memory accesses to 6 slices as follows [2, 14, 23, 8, 24, 53]. 43 percent of accesses are in the largest equivalence class. The 14 initializations are split as follows [2, 2, 3, 1, 2, 4]. The 15 writes are split as follows [0, 2, 5, 2, 2, 4]. [2023-11-28 20:21:02,274 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:21:02" (1/1) ... [2023-11-28 20:21:02,274 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:21:02" (1/1) ... [2023-11-28 20:21:02,296 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:21:02" (1/1) ... [2023-11-28 20:21:02,301 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:21:02" (1/1) ... [2023-11-28 20:21:02,304 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:21:02" (1/1) ... [2023-11-28 20:21:02,307 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:21:02" (1/1) ... [2023-11-28 20:21:02,313 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-28 20:21:02,314 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-28 20:21:02,314 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-28 20:21:02,314 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-28 20:21:02,315 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:21:02" (1/1) ... [2023-11-28 20:21:02,321 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-28 20:21:02,332 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4e2ee14-cabc-41d1-8098-6e58d93b95ed/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-28 20:21:02,344 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4e2ee14-cabc-41d1-8098-6e58d93b95ed/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-11-28 20:21:02,352 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4e2ee14-cabc-41d1-8098-6e58d93b95ed/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-11-28 20:21:02,383 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-28 20:21:02,383 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2023-11-28 20:21:02,383 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2023-11-28 20:21:02,384 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2023-11-28 20:21:02,384 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2023-11-28 20:21:02,384 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2023-11-28 20:21:02,384 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2023-11-28 20:21:02,384 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2023-11-28 20:21:02,384 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2023-11-28 20:21:02,384 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2023-11-28 20:21:02,385 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2023-11-28 20:21:02,385 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2023-11-28 20:21:02,385 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2023-11-28 20:21:02,385 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-11-28 20:21:02,385 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-11-28 20:21:02,385 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-11-28 20:21:02,386 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2023-11-28 20:21:02,386 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2023-11-28 20:21:02,386 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2023-11-28 20:21:02,386 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2023-11-28 20:21:02,386 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2023-11-28 20:21:02,386 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-28 20:21:02,386 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-28 20:21:02,502 INFO L241 CfgBuilder]: Building ICFG [2023-11-28 20:21:02,504 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-28 20:21:02,898 INFO L282 CfgBuilder]: Performing block encoding [2023-11-28 20:21:02,928 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-28 20:21:02,929 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-11-28 20:21:02,929 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 08:21:02 BoogieIcfgContainer [2023-11-28 20:21:02,929 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-28 20:21:02,932 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-28 20:21:02,932 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-28 20:21:02,936 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-28 20:21:02,936 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 08:21:01" (1/3) ... [2023-11-28 20:21:02,937 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@77b6725f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 08:21:02, skipping insertion in model container [2023-11-28 20:21:02,937 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:21:02" (2/3) ... [2023-11-28 20:21:02,937 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@77b6725f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 08:21:02, skipping insertion in model container [2023-11-28 20:21:02,937 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 08:21:02" (3/3) ... [2023-11-28 20:21:02,938 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-a_file-32.i [2023-11-28 20:21:02,957 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-28 20:21:02,958 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-28 20:21:03,009 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-28 20:21:03,014 INFO L357 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, mHoare=true, 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;@1c21e1f4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-28 20:21:03,015 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-28 20:21:03,018 INFO L276 IsEmpty]: Start isEmpty. Operand has 92 states, 71 states have (on average 1.408450704225352) internal successors, (100), 72 states have internal predecessors, (100), 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) [2023-11-28 20:21:03,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2023-11-28 20:21:03,034 INFO L187 NwaCegarLoop]: Found error trace [2023-11-28 20:21:03,035 INFO L195 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, 1, 1] [2023-11-28 20:21:03,035 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-28 20:21:03,040 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 20:21:03,041 INFO L85 PathProgramCache]: Analyzing trace with hash 841249278, now seen corresponding path program 1 times [2023-11-28 20:21:03,048 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 20:21:03,048 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [207800492] [2023-11-28 20:21:03,049 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:21:03,049 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 20:21:03,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:21:03,293 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-28 20:21:03,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:21:03,301 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-28 20:21:03,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:21:03,307 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-28 20:21:03,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:21:03,312 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-28 20:21:03,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:21:03,319 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-28 20:21:03,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:21:03,324 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-28 20:21:03,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:21:03,328 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-28 20:21:03,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:21:03,333 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-28 20:21:03,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:21:03,338 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-28 20:21:03,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:21:03,343 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-28 20:21:03,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:21:03,348 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-28 20:21:03,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:21:03,353 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-28 20:21:03,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:21:03,357 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-28 20:21:03,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:21:03,362 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-28 20:21:03,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:21:03,367 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-11-28 20:21:03,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:21:03,371 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-11-28 20:21:03,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:21:03,375 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-11-28 20:21:03,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:21:03,378 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-11-28 20:21:03,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:21:03,384 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2023-11-28 20:21:03,385 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-28 20:21:03,385 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [207800492] [2023-11-28 20:21:03,385 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [207800492] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 20:21:03,386 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 20:21:03,386 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-28 20:21:03,387 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [651488767] [2023-11-28 20:21:03,388 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 20:21:03,392 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-28 20:21:03,393 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-28 20:21:03,420 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-28 20:21:03,421 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-28 20:21:03,424 INFO L87 Difference]: Start difference. First operand has 92 states, 71 states have (on average 1.408450704225352) internal successors, (100), 72 states have internal predecessors, (100), 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 18.5) internal successors, (37), 2 states have internal predecessors, (37), 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) [2023-11-28 20:21:03,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-28 20:21:03,466 INFO L93 Difference]: Finished difference Result 181 states and 288 transitions. [2023-11-28 20:21:03,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-28 20:21:03,468 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 18.5) internal successors, (37), 2 states have internal predecessors, (37), 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 124 [2023-11-28 20:21:03,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-28 20:21:03,476 INFO L225 Difference]: With dead ends: 181 [2023-11-28 20:21:03,476 INFO L226 Difference]: Without dead ends: 90 [2023-11-28 20:21:03,480 INFO L412 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 [2023-11-28 20:21:03,483 INFO L413 NwaCegarLoop]: 123 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 123 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-28 20:21:03,484 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 123 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-28 20:21:03,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2023-11-28 20:21:03,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2023-11-28 20:21:03,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 70 states have (on average 1.3) internal successors, (91), 70 states have internal predecessors, (91), 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) [2023-11-28 20:21:03,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 127 transitions. [2023-11-28 20:21:03,521 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 127 transitions. Word has length 124 [2023-11-28 20:21:03,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-28 20:21:03,522 INFO L495 AbstractCegarLoop]: Abstraction has 90 states and 127 transitions. [2023-11-28 20:21:03,522 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 18.5) internal successors, (37), 2 states have internal predecessors, (37), 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) [2023-11-28 20:21:03,522 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 127 transitions. [2023-11-28 20:21:03,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2023-11-28 20:21:03,526 INFO L187 NwaCegarLoop]: Found error trace [2023-11-28 20:21:03,526 INFO L195 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, 1, 1] [2023-11-28 20:21:03,526 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-28 20:21:03,526 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-28 20:21:03,527 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 20:21:03,527 INFO L85 PathProgramCache]: Analyzing trace with hash 2096020442, now seen corresponding path program 1 times [2023-11-28 20:21:03,527 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 20:21:03,528 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [92542775] [2023-11-28 20:21:03,528 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:21:03,528 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 20:21:03,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:21:03,804 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-28 20:21:03,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:21:03,809 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-28 20:21:03,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:21:03,815 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-28 20:21:03,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:21:03,819 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-28 20:21:03,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:21:03,825 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-28 20:21:03,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:21:03,830 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-28 20:21:03,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:21:03,835 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-28 20:21:03,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:21:03,840 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-28 20:21:03,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:21:03,845 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-28 20:21:03,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:21:03,849 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-28 20:21:03,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:21:03,854 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-28 20:21:03,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:21:03,860 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-28 20:21:03,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:21:03,864 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-28 20:21:03,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:21:03,869 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-28 20:21:03,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:21:03,874 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-11-28 20:21:03,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:21:03,879 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-11-28 20:21:03,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:21:03,884 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-11-28 20:21:03,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:21:03,889 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-11-28 20:21:03,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:21:03,896 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2023-11-28 20:21:03,896 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-28 20:21:03,896 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [92542775] [2023-11-28 20:21:03,896 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [92542775] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 20:21:03,896 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 20:21:03,897 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-28 20:21:03,897 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [603602738] [2023-11-28 20:21:03,897 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 20:21:03,898 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-28 20:21:03,899 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-28 20:21:03,900 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-28 20:21:03,900 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-28 20:21:03,900 INFO L87 Difference]: Start difference. First operand 90 states and 127 transitions. Second operand has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 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) [2023-11-28 20:21:04,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-28 20:21:04,058 INFO L93 Difference]: Finished difference Result 306 states and 432 transitions. [2023-11-28 20:21:04,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-28 20:21:04,059 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 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 124 [2023-11-28 20:21:04,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-28 20:21:04,063 INFO L225 Difference]: With dead ends: 306 [2023-11-28 20:21:04,063 INFO L226 Difference]: Without dead ends: 217 [2023-11-28 20:21:04,064 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-28 20:21:04,065 INFO L413 NwaCegarLoop]: 115 mSDtfsCounter, 206 mSDsluCounter, 235 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 206 SdHoareTripleChecker+Valid, 350 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-28 20:21:04,066 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [206 Valid, 350 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-28 20:21:04,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2023-11-28 20:21:04,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 185. [2023-11-28 20:21:04,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 185 states, 146 states have (on average 1.3013698630136987) internal successors, (190), 146 states have internal predecessors, (190), 36 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2023-11-28 20:21:04,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 262 transitions. [2023-11-28 20:21:04,094 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 262 transitions. Word has length 124 [2023-11-28 20:21:04,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-28 20:21:04,095 INFO L495 AbstractCegarLoop]: Abstraction has 185 states and 262 transitions. [2023-11-28 20:21:04,095 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 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) [2023-11-28 20:21:04,095 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 262 transitions. [2023-11-28 20:21:04,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2023-11-28 20:21:04,098 INFO L187 NwaCegarLoop]: Found error trace [2023-11-28 20:21:04,098 INFO L195 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-28 20:21:04,098 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-28 20:21:04,099 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-28 20:21:04,099 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 20:21:04,099 INFO L85 PathProgramCache]: Analyzing trace with hash 442873600, now seen corresponding path program 1 times [2023-11-28 20:21:04,099 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 20:21:04,100 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [705201492] [2023-11-28 20:21:04,100 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:21:04,100 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 20:21:04,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:21:05,369 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-28 20:21:05,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:21:05,372 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-28 20:21:05,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:21:05,375 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-28 20:21:05,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:21:05,378 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-28 20:21:05,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:21:05,380 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-28 20:21:05,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:21:05,382 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-28 20:21:05,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:21:05,385 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-28 20:21:05,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:21:05,387 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-28 20:21:05,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:21:05,389 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-28 20:21:05,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:21:05,391 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-28 20:21:05,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:21:05,394 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-28 20:21:05,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:21:05,397 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-28 20:21:05,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:21:05,400 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-28 20:21:05,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:21:05,402 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-28 20:21:05,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:21:05,405 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-11-28 20:21:05,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:21:05,407 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-11-28 20:21:05,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:21:05,410 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-11-28 20:21:05,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:21:05,413 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-11-28 20:21:05,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:21:05,416 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2023-11-28 20:21:05,416 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-28 20:21:05,417 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [705201492] [2023-11-28 20:21:05,417 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [705201492] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 20:21:05,417 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 20:21:05,417 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2023-11-28 20:21:05,417 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1213517745] [2023-11-28 20:21:05,418 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 20:21:05,418 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-11-28 20:21:05,419 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-28 20:21:05,420 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-11-28 20:21:05,420 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2023-11-28 20:21:05,420 INFO L87 Difference]: Start difference. First operand 185 states and 262 transitions. Second operand has 12 states, 11 states have (on average 4.090909090909091) internal successors, (45), 12 states have internal predecessors, (45), 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) [2023-11-28 20:21:06,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-28 20:21:06,381 INFO L93 Difference]: Finished difference Result 595 states and 847 transitions. [2023-11-28 20:21:06,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-11-28 20:21:06,382 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 4.090909090909091) internal successors, (45), 12 states have internal predecessors, (45), 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 132 [2023-11-28 20:21:06,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-28 20:21:06,386 INFO L225 Difference]: With dead ends: 595 [2023-11-28 20:21:06,386 INFO L226 Difference]: Without dead ends: 411 [2023-11-28 20:21:06,389 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=95, Invalid=367, Unknown=0, NotChecked=0, Total=462 [2023-11-28 20:21:06,390 INFO L413 NwaCegarLoop]: 106 mSDtfsCounter, 331 mSDsluCounter, 821 mSDsCounter, 0 mSdLazyCounter, 564 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 332 SdHoareTripleChecker+Valid, 927 SdHoareTripleChecker+Invalid, 568 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 564 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-11-28 20:21:06,391 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [332 Valid, 927 Invalid, 568 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 564 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-11-28 20:21:06,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 411 states. [2023-11-28 20:21:06,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 411 to 337. [2023-11-28 20:21:06,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 337 states, 272 states have (on average 1.3125) internal successors, (357), 274 states have internal predecessors, (357), 60 states have call successors, (60), 4 states have call predecessors, (60), 4 states have return successors, (60), 58 states have call predecessors, (60), 60 states have call successors, (60) [2023-11-28 20:21:06,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 337 states to 337 states and 477 transitions. [2023-11-28 20:21:06,438 INFO L78 Accepts]: Start accepts. Automaton has 337 states and 477 transitions. Word has length 132 [2023-11-28 20:21:06,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-28 20:21:06,439 INFO L495 AbstractCegarLoop]: Abstraction has 337 states and 477 transitions. [2023-11-28 20:21:06,439 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 4.090909090909091) internal successors, (45), 12 states have internal predecessors, (45), 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) [2023-11-28 20:21:06,439 INFO L276 IsEmpty]: Start isEmpty. Operand 337 states and 477 transitions. [2023-11-28 20:21:06,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2023-11-28 20:21:06,443 INFO L187 NwaCegarLoop]: Found error trace [2023-11-28 20:21:06,443 INFO L195 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-28 20:21:06,443 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-28 20:21:06,444 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-28 20:21:06,444 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 20:21:06,444 INFO L85 PathProgramCache]: Analyzing trace with hash 1233213465, now seen corresponding path program 1 times [2023-11-28 20:21:06,444 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 20:21:06,444 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1353524645] [2023-11-28 20:21:06,445 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:21:06,445 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 20:21:06,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:21:09,288 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-28 20:21:09,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:21:09,292 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-28 20:21:09,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:21:09,297 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-28 20:21:09,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:21:09,300 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-28 20:21:09,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:21:09,304 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-28 20:21:09,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:21:09,307 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-28 20:21:09,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:21:09,311 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-28 20:21:09,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:21:09,314 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-28 20:21:09,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:21:09,317 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-28 20:21:09,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:21:09,321 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-28 20:21:09,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:21:09,325 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-28 20:21:09,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:21:09,329 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-28 20:21:09,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:21:09,332 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-28 20:21:09,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:21:09,336 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-28 20:21:09,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:21:09,340 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-11-28 20:21:09,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:21:09,343 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-11-28 20:21:09,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:21:09,347 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-11-28 20:21:09,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:21:09,350 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-11-28 20:21:09,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:21:09,355 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2023-11-28 20:21:09,356 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-28 20:21:09,356 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1353524645] [2023-11-28 20:21:09,356 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1353524645] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 20:21:09,356 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 20:21:09,356 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2023-11-28 20:21:09,356 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1230824031] [2023-11-28 20:21:09,357 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 20:21:09,357 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2023-11-28 20:21:09,357 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-28 20:21:09,358 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2023-11-28 20:21:09,359 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=295, Unknown=0, NotChecked=0, Total=342 [2023-11-28 20:21:09,359 INFO L87 Difference]: Start difference. First operand 337 states and 477 transitions. Second operand has 19 states, 15 states have (on average 3.1333333333333333) internal successors, (47), 19 states have internal predecessors, (47), 5 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 5 states have call successors, (18) [2023-11-28 20:21:16,289 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-28 20:21:22,853 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.03s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-28 20:21:33,269 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-28 20:21:35,607 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.26s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-28 20:21:40,337 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-28 20:21:41,785 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.29s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-28 20:21:43,864 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.92s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-28 20:21:46,901 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.99s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-28 20:21:48,589 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.19s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-28 20:21:51,463 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.36s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-28 20:21:54,154 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.64s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-28 20:21:56,991 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.39s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-28 20:21:58,871 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.76s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-28 20:22:04,241 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.23s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-28 20:22:06,407 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.08s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-28 20:22:10,597 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-28 20:22:12,054 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.40s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-28 20:22:16,065 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-28 20:22:19,669 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.21s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-28 20:22:19,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-28 20:22:19,762 INFO L93 Difference]: Finished difference Result 837 states and 1167 transitions. [2023-11-28 20:22:19,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2023-11-28 20:22:19,762 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 15 states have (on average 3.1333333333333333) internal successors, (47), 19 states have internal predecessors, (47), 5 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 5 states have call successors, (18) Word has length 134 [2023-11-28 20:22:19,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-28 20:22:19,767 INFO L225 Difference]: With dead ends: 837 [2023-11-28 20:22:19,767 INFO L226 Difference]: Without dead ends: 501 [2023-11-28 20:22:19,768 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 148 ImplicationChecksByTransitivity, 11.5s TimeCoverageRelationStatistics Valid=147, Invalid=844, Unknown=1, NotChecked=0, Total=992 [2023-11-28 20:22:19,768 INFO L413 NwaCegarLoop]: 121 mSDtfsCounter, 559 mSDsluCounter, 1225 mSDsCounter, 0 mSdLazyCounter, 1641 mSolverCounterSat, 116 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 59.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 563 SdHoareTripleChecker+Valid, 1346 SdHoareTripleChecker+Invalid, 1762 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 116 IncrementalHoareTripleChecker+Valid, 1641 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 59.5s IncrementalHoareTripleChecker+Time [2023-11-28 20:22:19,769 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [563 Valid, 1346 Invalid, 1762 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [116 Valid, 1641 Invalid, 5 Unknown, 0 Unchecked, 59.5s Time] [2023-11-28 20:22:19,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 501 states. [2023-11-28 20:22:19,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 501 to 436. [2023-11-28 20:22:19,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 436 states, 346 states have (on average 1.2890173410404624) internal successors, (446), 350 states have internal predecessors, (446), 82 states have call successors, (82), 7 states have call predecessors, (82), 7 states have return successors, (82), 78 states have call predecessors, (82), 82 states have call successors, (82) [2023-11-28 20:22:19,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 436 states to 436 states and 610 transitions. [2023-11-28 20:22:19,836 INFO L78 Accepts]: Start accepts. Automaton has 436 states and 610 transitions. Word has length 134 [2023-11-28 20:22:19,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-28 20:22:19,837 INFO L495 AbstractCegarLoop]: Abstraction has 436 states and 610 transitions. [2023-11-28 20:22:19,837 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 15 states have (on average 3.1333333333333333) internal successors, (47), 19 states have internal predecessors, (47), 5 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 5 states have call successors, (18) [2023-11-28 20:22:19,837 INFO L276 IsEmpty]: Start isEmpty. Operand 436 states and 610 transitions. [2023-11-28 20:22:19,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2023-11-28 20:22:19,840 INFO L187 NwaCegarLoop]: Found error trace [2023-11-28 20:22:19,840 INFO L195 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-28 20:22:19,840 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-28 20:22:19,841 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-28 20:22:19,841 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 20:22:19,841 INFO L85 PathProgramCache]: Analyzing trace with hash 1089429525, now seen corresponding path program 1 times [2023-11-28 20:22:19,841 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 20:22:19,842 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [908820978] [2023-11-28 20:22:19,842 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:22:19,842 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 20:22:19,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:22:20,006 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-28 20:22:20,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:22:20,008 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-28 20:22:20,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:22:20,010 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-28 20:22:20,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:22:20,012 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-28 20:22:20,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:22:20,014 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-28 20:22:20,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:22:20,016 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-28 20:22:20,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:22:20,018 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-28 20:22:20,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:22:20,020 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-28 20:22:20,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:22:20,023 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-28 20:22:20,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:22:20,025 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-28 20:22:20,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:22:20,027 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-28 20:22:20,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:22:20,030 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-28 20:22:20,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:22:20,032 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-28 20:22:20,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:22:20,033 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-28 20:22:20,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:22:20,035 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-11-28 20:22:20,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:22:20,037 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-11-28 20:22:20,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:22:20,039 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-11-28 20:22:20,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:22:20,041 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-11-28 20:22:20,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:22:20,044 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2023-11-28 20:22:20,045 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-28 20:22:20,045 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [908820978] [2023-11-28 20:22:20,045 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [908820978] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 20:22:20,045 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 20:22:20,045 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-28 20:22:20,045 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [945766879] [2023-11-28 20:22:20,045 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 20:22:20,046 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-28 20:22:20,046 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-28 20:22:20,046 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-28 20:22:20,047 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-28 20:22:20,047 INFO L87 Difference]: Start difference. First operand 436 states and 610 transitions. Second operand has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 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) [2023-11-28 20:22:20,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-28 20:22:20,137 INFO L93 Difference]: Finished difference Result 911 states and 1274 transitions. [2023-11-28 20:22:20,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-28 20:22:20,138 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 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 134 [2023-11-28 20:22:20,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-28 20:22:20,142 INFO L225 Difference]: With dead ends: 911 [2023-11-28 20:22:20,143 INFO L226 Difference]: Without dead ends: 496 [2023-11-28 20:22:20,144 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-11-28 20:22:20,145 INFO L413 NwaCegarLoop]: 120 mSDtfsCounter, 60 mSDsluCounter, 334 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 454 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-28 20:22:20,145 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 454 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-28 20:22:20,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 496 states. [2023-11-28 20:22:20,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 496 to 451. [2023-11-28 20:22:20,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 451 states, 361 states have (on average 1.2770083102493075) internal successors, (461), 365 states have internal predecessors, (461), 82 states have call successors, (82), 7 states have call predecessors, (82), 7 states have return successors, (82), 78 states have call predecessors, (82), 82 states have call successors, (82) [2023-11-28 20:22:20,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 451 states to 451 states and 625 transitions. [2023-11-28 20:22:20,224 INFO L78 Accepts]: Start accepts. Automaton has 451 states and 625 transitions. Word has length 134 [2023-11-28 20:22:20,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-28 20:22:20,224 INFO L495 AbstractCegarLoop]: Abstraction has 451 states and 625 transitions. [2023-11-28 20:22:20,225 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 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) [2023-11-28 20:22:20,225 INFO L276 IsEmpty]: Start isEmpty. Operand 451 states and 625 transitions. [2023-11-28 20:22:20,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2023-11-28 20:22:20,227 INFO L187 NwaCegarLoop]: Found error trace [2023-11-28 20:22:20,227 INFO L195 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-28 20:22:20,227 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-28 20:22:20,227 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-28 20:22:20,228 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 20:22:20,228 INFO L85 PathProgramCache]: Analyzing trace with hash 1997485593, now seen corresponding path program 1 times [2023-11-28 20:22:20,228 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 20:22:20,228 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [168654132] [2023-11-28 20:22:20,228 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:22:20,228 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 20:22:20,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:23:36,787 WARN L293 SmtUtils]: Spent 14.26s on a formula simplification that was a NOOP. DAG size: 103 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-11-28 20:24:04,433 WARN L293 SmtUtils]: Spent 9.14s on a formula simplification that was a NOOP. DAG size: 105 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-11-28 20:24:43,262 WARN L293 SmtUtils]: Spent 9.91s on a formula simplification that was a NOOP. DAG size: 103 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-11-28 20:25:26,780 WARN L293 SmtUtils]: Spent 5.79s on a formula simplification that was a NOOP. DAG size: 105 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-11-28 20:25:53,720 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-28 20:25:53,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:25:53,723 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-28 20:25:53,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:25:53,726 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-28 20:25:53,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:25:53,729 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-28 20:25:53,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:25:53,732 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-28 20:25:53,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:25:53,736 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-28 20:25:53,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:25:53,739 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-28 20:25:53,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:25:53,743 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-28 20:25:53,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:25:53,746 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-28 20:25:53,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:25:53,750 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-28 20:25:53,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:25:53,753 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-28 20:25:53,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:25:53,756 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-28 20:25:53,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:25:53,759 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-28 20:25:53,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:25:53,762 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-28 20:25:53,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:25:53,766 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-11-28 20:25:53,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:25:53,769 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-11-28 20:25:53,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:25:53,773 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-11-28 20:25:53,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:25:53,776 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-11-28 20:25:53,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:25:53,781 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2023-11-28 20:25:53,782 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-28 20:25:53,782 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [168654132] [2023-11-28 20:25:53,782 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [168654132] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 20:25:53,782 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 20:25:53,782 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2023-11-28 20:25:53,782 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1291065407] [2023-11-28 20:25:53,782 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 20:25:53,783 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2023-11-28 20:25:53,783 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-28 20:25:53,784 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2023-11-28 20:25:53,784 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=309, Unknown=21, NotChecked=0, Total=380 [2023-11-28 20:25:53,784 INFO L87 Difference]: Start difference. First operand 451 states and 625 transitions. Second operand has 20 states, 17 states have (on average 2.764705882352941) internal successors, (47), 20 states have internal predecessors, (47), 4 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 4 states have call successors, (18)