./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_normal_file-63.i --full-output --architecture 32bit
--------------------------------------------------------------------------------
Checking for ERROR reachability
Using default analysis
Version a0165632
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_22f3ce76-6050-4203-b56a-86e323d783ed/bin/uautomizer-verify-jihMAELWvX/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22f3ce76-6050-4203-b56a-86e323d783ed/bin/uautomizer-verify-jihMAELWvX/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22f3ce76-6050-4203-b56a-86e323d783ed/bin/uautomizer-verify-jihMAELWvX/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22f3ce76-6050-4203-b56a-86e323d783ed/bin/uautomizer-verify-jihMAELWvX/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_normal_file-63.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22f3ce76-6050-4203-b56a-86e323d783ed/bin/uautomizer-verify-jihMAELWvX/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22f3ce76-6050-4203-b56a-86e323d783ed/bin/uautomizer-verify-jihMAELWvX --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) )
--witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 22049259aa90ec31463fad29fa04047c315294147ab56d7684d575018f4c12a6
--- Real Ultimate output ---
This is Ultimate 0.2.5-dev-a016563
[2024-11-08 17:12:10,366 INFO L188 SettingsManager]: Resetting all preferences to default values...
[2024-11-08 17:12:10,432 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22f3ce76-6050-4203-b56a-86e323d783ed/bin/uautomizer-verify-jihMAELWvX/config/svcomp-Reach-32bit-Automizer_Default.epf
[2024-11-08 17:12:10,437 WARN L101 SettingsManager]: Preference file contains the following unknown settings:
[2024-11-08 17:12:10,438 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2024-11-08 17:12:10,487 INFO L130 SettingsManager]: Preferences different from defaults after loading the file:
[2024-11-08 17:12:10,488 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2024-11-08 17:12:10,490 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2024-11-08 17:12:10,491 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults:
[2024-11-08 17:12:10,492 INFO L153 SettingsManager]: * Use memory slicer=true
[2024-11-08 17:12:10,493 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2024-11-08 17:12:10,493 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2024-11-08 17:12:10,494 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2024-11-08 17:12:10,494 INFO L153 SettingsManager]: * Create parallel compositions if possible=false
[2024-11-08 17:12:10,497 INFO L153 SettingsManager]: * Use SBE=true
[2024-11-08 17:12:10,498 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2024-11-08 17:12:10,498 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE
[2024-11-08 17:12:10,499 INFO L153 SettingsManager]: * sizeof long=4
[2024-11-08 17:12:10,499 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true
[2024-11-08 17:12:10,499 INFO L153 SettingsManager]: * sizeof POINTER=4
[2024-11-08 17:12:10,500 INFO L153 SettingsManager]: * Check division by zero=IGNORE
[2024-11-08 17:12:10,505 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE
[2024-11-08 17:12:10,505 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE
[2024-11-08 17:12:10,505 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE
[2024-11-08 17:12:10,506 INFO L153 SettingsManager]: * Allow undefined functions=false
[2024-11-08 17:12:10,506 INFO L153 SettingsManager]: * sizeof long double=12
[2024-11-08 17:12:10,506 INFO L153 SettingsManager]: * Check if freed pointer was valid=false
[2024-11-08 17:12:10,506 INFO L153 SettingsManager]: * Use constant arrays=true
[2024-11-08 17:12:10,507 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2024-11-08 17:12:10,507 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements
[2024-11-08 17:12:10,508 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true
[2024-11-08 17:12:10,508 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode
[2024-11-08 17:12:10,509 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-11-08 17:12:10,510 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2024-11-08 17:12:10,511 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP
[2024-11-08 17:12:10,511 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads
[2024-11-08 17:12:10,512 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL
[2024-11-08 17:12:10,513 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2024-11-08 17:12:10,513 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false
[2024-11-08 17:12:10,513 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET
[2024-11-08 17:12:10,514 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO
[2024-11-08 17:12:10,514 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode
[2024-11-08 17:12:10,514 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_22f3ce76-6050-4203-b56a-86e323d783ed/bin/uautomizer-verify-jihMAELWvX/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int)
WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1
WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations
WARNING: All illegal access operations will be denied in a future release
Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22f3ce76-6050-4203-b56a-86e323d783ed/bin/uautomizer-verify-jihMAELWvX
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) )
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 22049259aa90ec31463fad29fa04047c315294147ab56d7684d575018f4c12a6
[2024-11-08 17:12:10,857 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp
[2024-11-08 17:12:10,895 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2024-11-08 17:12:10,898 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2024-11-08 17:12:10,900 INFO L270 PluginConnector]: Initializing CDTParser...
[2024-11-08 17:12:10,900 INFO L274 PluginConnector]: CDTParser initialized
[2024-11-08 17:12:10,902 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22f3ce76-6050-4203-b56a-86e323d783ed/bin/uautomizer-verify-jihMAELWvX/../../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_normal_file-63.i
Unable to find full path for "g++"
[2024-11-08 17:12:13,243 INFO L533 CDTParser]: Created temporary CDT project at NULL
[2024-11-08 17:12:13,550 INFO L384 CDTParser]: Found 1 translation units.
[2024-11-08 17:12:13,550 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22f3ce76-6050-4203-b56a-86e323d783ed/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_normal_file-63.i
[2024-11-08 17:12:13,562 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22f3ce76-6050-4203-b56a-86e323d783ed/bin/uautomizer-verify-jihMAELWvX/data/e67d04f91/6bea3873a694446ba925731d9a31c25d/FLAGfe2c4390b
[2024-11-08 17:12:13,835 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22f3ce76-6050-4203-b56a-86e323d783ed/bin/uautomizer-verify-jihMAELWvX/data/e67d04f91/6bea3873a694446ba925731d9a31c25d
[2024-11-08 17:12:13,837 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2024-11-08 17:12:13,839 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements.
[2024-11-08 17:12:13,841 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2024-11-08 17:12:13,841 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator...
[2024-11-08 17:12:13,850 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized
[2024-11-08 17:12:13,851 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 05:12:13" (1/1) ...
[2024-11-08 17:12:13,852 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2f0787bc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:12:13, skipping insertion in model container
[2024-11-08 17:12:13,856 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 05:12:13" (1/1) ...
[2024-11-08 17:12:13,900 INFO L175 MainTranslator]: Built tables and reachable declarations
[2024-11-08 17:12:14,117 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22f3ce76-6050-4203-b56a-86e323d783ed/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_normal_file-63.i[913,926]
[2024-11-08 17:12:14,211 INFO L210 PostProcessor]: Analyzing one entry point: main
[2024-11-08 17:12:14,232 INFO L200 MainTranslator]: Completed pre-run
[2024-11-08 17:12:14,251 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22f3ce76-6050-4203-b56a-86e323d783ed/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_normal_file-63.i[913,926]
[2024-11-08 17:12:14,321 INFO L210 PostProcessor]: Analyzing one entry point: main
[2024-11-08 17:12:14,357 INFO L204 MainTranslator]: Completed translation
[2024-11-08 17:12:14,358 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:12:14 WrapperNode
[2024-11-08 17:12:14,358 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2024-11-08 17:12:14,359 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2024-11-08 17:12:14,360 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner...
[2024-11-08 17:12:14,360 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized
[2024-11-08 17:12:14,369 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:12:14" (1/1) ...
[2024-11-08 17:12:14,386 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:12:14" (1/1) ...
[2024-11-08 17:12:14,443 INFO L138 Inliner]: procedures = 26, calls = 29, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 173
[2024-11-08 17:12:14,444 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2024-11-08 17:12:14,445 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2024-11-08 17:12:14,445 INFO L270 PluginConnector]: Initializing Boogie Preprocessor...
[2024-11-08 17:12:14,445 INFO L274 PluginConnector]: Boogie Preprocessor initialized
[2024-11-08 17:12:14,460 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:12:14" (1/1) ...
[2024-11-08 17:12:14,460 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:12:14" (1/1) ...
[2024-11-08 17:12:14,464 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:12:14" (1/1) ...
[2024-11-08 17:12:14,485 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0].
[2024-11-08 17:12:14,485 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:12:14" (1/1) ...
[2024-11-08 17:12:14,486 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:12:14" (1/1) ...
[2024-11-08 17:12:14,496 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:12:14" (1/1) ...
[2024-11-08 17:12:14,500 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:12:14" (1/1) ...
[2024-11-08 17:12:14,503 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:12:14" (1/1) ...
[2024-11-08 17:12:14,510 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:12:14" (1/1) ...
[2024-11-08 17:12:14,519 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2024-11-08 17:12:14,520 INFO L112 PluginConnector]: ------------------------RCFGBuilder----------------------------
[2024-11-08 17:12:14,520 INFO L270 PluginConnector]: Initializing RCFGBuilder...
[2024-11-08 17:12:14,520 INFO L274 PluginConnector]: RCFGBuilder initialized
[2024-11-08 17:12:14,522 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:12:14" (1/1) ...
[2024-11-08 17:12:14,537 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-11-08 17:12:14,561 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22f3ce76-6050-4203-b56a-86e323d783ed/bin/uautomizer-verify-jihMAELWvX/z3
[2024-11-08 17:12:14,592 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22f3ce76-6050-4203-b56a-86e323d783ed/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null)
[2024-11-08 17:12:14,597 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22f3ce76-6050-4203-b56a-86e323d783ed/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process
[2024-11-08 17:12:14,638 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2024-11-08 17:12:14,639 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not
[2024-11-08 17:12:14,639 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not
[2024-11-08 17:12:14,639 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0
[2024-11-08 17:12:14,640 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2024-11-08 17:12:14,640 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2024-11-08 17:12:14,780 INFO L238 CfgBuilder]: Building ICFG
[2024-11-08 17:12:14,786 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation
[2024-11-08 17:12:15,260 INFO L? ?]: Removed 17 outVars from TransFormulas that were not future-live.
[2024-11-08 17:12:15,261 INFO L287 CfgBuilder]: Performing block encoding
[2024-11-08 17:12:15,277 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2024-11-08 17:12:15,277 INFO L316 CfgBuilder]: Removed 1 assume(true) statements.
[2024-11-08 17:12:15,278 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 05:12:15 BoogieIcfgContainer
[2024-11-08 17:12:15,278 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2024-11-08 17:12:15,281 INFO L112 PluginConnector]: ------------------------TraceAbstraction----------------------------
[2024-11-08 17:12:15,281 INFO L270 PluginConnector]: Initializing TraceAbstraction...
[2024-11-08 17:12:15,285 INFO L274 PluginConnector]: TraceAbstraction initialized
[2024-11-08 17:12:15,286 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 05:12:13" (1/3) ...
[2024-11-08 17:12:15,287 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@bfca7af and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 05:12:15, skipping insertion in model container
[2024-11-08 17:12:15,287 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:12:14" (2/3) ...
[2024-11-08 17:12:15,288 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@bfca7af and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 05:12:15, skipping insertion in model container
[2024-11-08 17:12:15,288 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 05:12:15" (3/3) ...
[2024-11-08 17:12:15,290 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_normal_file-63.i
[2024-11-08 17:12:15,312 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2024-11-08 17:12:15,313 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations.
[2024-11-08 17:12:15,387 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2024-11-08 17:12:15,394 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@22b2e50d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2024-11-08 17:12:15,394 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations.
[2024-11-08 17:12:15,401 INFO L276 IsEmpty]: Start isEmpty. Operand has 72 states, 53 states have (on average 1.3962264150943395) internal successors, (74), 54 states have internal predecessors, (74), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16)
[2024-11-08 17:12:15,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117
[2024-11-08 17:12:15,426 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-08 17:12:15,427 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-08 17:12:15,427 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-08 17:12:15,434 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 17:12:15,434 INFO L85 PathProgramCache]: Analyzing trace with hash -159868641, now seen corresponding path program 1 times
[2024-11-08 17:12:15,446 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-08 17:12:15,447 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2081878126]
[2024-11-08 17:12:15,447 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 17:12:15,448 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-08 17:12:15,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:12:15,823 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5
[2024-11-08 17:12:15,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:12:15,832 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10
[2024-11-08 17:12:15,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:12:15,840 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16
[2024-11-08 17:12:15,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:12:15,848 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21
[2024-11-08 17:12:15,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:12:15,859 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27
[2024-11-08 17:12:15,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:12:15,868 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32
[2024-11-08 17:12:15,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:12:15,875 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38
[2024-11-08 17:12:15,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:12:15,882 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44
[2024-11-08 17:12:15,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:12:15,890 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50
[2024-11-08 17:12:15,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:12:15,897 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56
[2024-11-08 17:12:15,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:12:15,904 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62
[2024-11-08 17:12:15,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:12:15,910 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68
[2024-11-08 17:12:15,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:12:15,917 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74
[2024-11-08 17:12:15,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:12:15,923 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79
[2024-11-08 17:12:15,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:12:15,930 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85
[2024-11-08 17:12:15,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:12:15,937 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90
[2024-11-08 17:12:15,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:12:15,946 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked.
[2024-11-08 17:12:15,947 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-08 17:12:15,947 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2081878126]
[2024-11-08 17:12:15,948 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2081878126] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-08 17:12:15,949 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-08 17:12:15,949 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-11-08 17:12:15,951 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [813700069]
[2024-11-08 17:12:15,954 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-08 17:12:15,962 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states
[2024-11-08 17:12:15,962 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-08 17:12:15,998 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants.
[2024-11-08 17:12:15,999 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2
[2024-11-08 17:12:16,002 INFO L87 Difference]: Start difference. First operand has 72 states, 53 states have (on average 1.3962264150943395) internal successors, (74), 54 states have internal predecessors, (74), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand has 2 states, 2 states have (on average 19.5) internal successors, (39), 2 states have internal predecessors, (39), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16)
[2024-11-08 17:12:16,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-08 17:12:16,045 INFO L93 Difference]: Finished difference Result 137 states and 222 transitions.
[2024-11-08 17:12:16,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states.
[2024-11-08 17:12:16,048 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 19.5) internal successors, (39), 2 states have internal predecessors, (39), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) Word has length 116
[2024-11-08 17:12:16,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-08 17:12:16,058 INFO L225 Difference]: With dead ends: 137
[2024-11-08 17:12:16,059 INFO L226 Difference]: Without dead ends: 68
[2024-11-08 17:12:16,065 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2
[2024-11-08 17:12:16,071 INFO L432 NwaCegarLoop]: 99 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 99 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2024-11-08 17:12:16,074 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 99 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2024-11-08 17:12:16,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states.
[2024-11-08 17:12:16,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68.
[2024-11-08 17:12:16,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 50 states have (on average 1.34) internal successors, (67), 50 states have internal predecessors, (67), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16)
[2024-11-08 17:12:16,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 99 transitions.
[2024-11-08 17:12:16,150 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 99 transitions. Word has length 116
[2024-11-08 17:12:16,151 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-08 17:12:16,151 INFO L471 AbstractCegarLoop]: Abstraction has 68 states and 99 transitions.
[2024-11-08 17:12:16,152 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 19.5) internal successors, (39), 2 states have internal predecessors, (39), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16)
[2024-11-08 17:12:16,152 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 99 transitions.
[2024-11-08 17:12:16,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117
[2024-11-08 17:12:16,156 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-08 17:12:16,157 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-08 17:12:16,157 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2024-11-08 17:12:16,158 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-08 17:12:16,158 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 17:12:16,159 INFO L85 PathProgramCache]: Analyzing trace with hash 1094857171, now seen corresponding path program 1 times
[2024-11-08 17:12:16,159 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-08 17:12:16,159 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1239444212]
[2024-11-08 17:12:16,160 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 17:12:16,160 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-08 17:12:16,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:12:16,506 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5
[2024-11-08 17:12:16,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:12:16,511 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10
[2024-11-08 17:12:16,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:12:16,517 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16
[2024-11-08 17:12:16,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:12:16,522 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21
[2024-11-08 17:12:16,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:12:16,527 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27
[2024-11-08 17:12:16,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:12:16,532 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32
[2024-11-08 17:12:16,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:12:16,536 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38
[2024-11-08 17:12:16,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:12:16,545 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44
[2024-11-08 17:12:16,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:12:16,554 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50
[2024-11-08 17:12:16,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:12:16,559 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56
[2024-11-08 17:12:16,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:12:16,569 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62
[2024-11-08 17:12:16,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:12:16,575 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68
[2024-11-08 17:12:16,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:12:16,580 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74
[2024-11-08 17:12:16,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:12:16,587 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79
[2024-11-08 17:12:16,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:12:16,594 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85
[2024-11-08 17:12:16,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:12:16,603 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90
[2024-11-08 17:12:16,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:12:16,612 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked.
[2024-11-08 17:12:16,616 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-08 17:12:16,617 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1239444212]
[2024-11-08 17:12:16,617 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1239444212] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-08 17:12:16,617 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-08 17:12:16,617 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2024-11-08 17:12:16,617 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1568164747]
[2024-11-08 17:12:16,618 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-08 17:12:16,619 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-11-08 17:12:16,623 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-08 17:12:16,624 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-11-08 17:12:16,624 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-11-08 17:12:16,625 INFO L87 Difference]: Start difference. First operand 68 states and 99 transitions. Second operand has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16)
[2024-11-08 17:12:16,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-08 17:12:16,723 INFO L93 Difference]: Finished difference Result 163 states and 238 transitions.
[2024-11-08 17:12:16,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2024-11-08 17:12:16,724 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 116
[2024-11-08 17:12:16,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-08 17:12:16,727 INFO L225 Difference]: With dead ends: 163
[2024-11-08 17:12:16,727 INFO L226 Difference]: Without dead ends: 98
[2024-11-08 17:12:16,728 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-11-08 17:12:16,730 INFO L432 NwaCegarLoop]: 115 mSDtfsCounter, 33 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 199 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2024-11-08 17:12:16,730 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 199 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2024-11-08 17:12:16,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states.
[2024-11-08 17:12:16,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 81.
[2024-11-08 17:12:16,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 63 states have (on average 1.3650793650793651) internal successors, (86), 63 states have internal predecessors, (86), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16)
[2024-11-08 17:12:16,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 118 transitions.
[2024-11-08 17:12:16,745 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 118 transitions. Word has length 116
[2024-11-08 17:12:16,746 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-08 17:12:16,747 INFO L471 AbstractCegarLoop]: Abstraction has 81 states and 118 transitions.
[2024-11-08 17:12:16,747 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16)
[2024-11-08 17:12:16,748 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 118 transitions.
[2024-11-08 17:12:16,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117
[2024-11-08 17:12:16,750 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-08 17:12:16,750 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-08 17:12:16,751 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2024-11-08 17:12:16,751 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-08 17:12:16,752 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 17:12:16,752 INFO L85 PathProgramCache]: Analyzing trace with hash 1807331859, now seen corresponding path program 1 times
[2024-11-08 17:12:16,752 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-08 17:12:16,752 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1388675529]
[2024-11-08 17:12:16,753 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 17:12:16,753 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-08 17:12:16,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:12:17,296 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5
[2024-11-08 17:12:17,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:12:17,300 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10
[2024-11-08 17:12:17,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:12:17,305 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16
[2024-11-08 17:12:17,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:12:17,308 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21
[2024-11-08 17:12:17,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:12:17,312 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27
[2024-11-08 17:12:17,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:12:17,320 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32
[2024-11-08 17:12:17,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:12:17,324 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38
[2024-11-08 17:12:17,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:12:17,328 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44
[2024-11-08 17:12:17,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:12:17,333 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50
[2024-11-08 17:12:17,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:12:17,342 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56
[2024-11-08 17:12:17,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:12:17,350 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62
[2024-11-08 17:12:17,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:12:17,354 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68
[2024-11-08 17:12:17,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:12:17,358 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74
[2024-11-08 17:12:17,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:12:17,361 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79
[2024-11-08 17:12:17,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:12:17,365 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85
[2024-11-08 17:12:17,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:12:17,369 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90
[2024-11-08 17:12:17,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:12:17,373 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked.
[2024-11-08 17:12:17,374 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-08 17:12:17,374 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1388675529]
[2024-11-08 17:12:17,374 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1388675529] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-08 17:12:17,375 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-08 17:12:17,375 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2024-11-08 17:12:17,375 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [966180093]
[2024-11-08 17:12:17,375 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-08 17:12:17,376 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2024-11-08 17:12:17,376 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-08 17:12:17,377 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2024-11-08 17:12:17,377 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2024-11-08 17:12:17,377 INFO L87 Difference]: Start difference. First operand 81 states and 118 transitions. Second operand has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16)
[2024-11-08 17:12:17,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-08 17:12:17,679 INFO L93 Difference]: Finished difference Result 230 states and 339 transitions.
[2024-11-08 17:12:17,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states.
[2024-11-08 17:12:17,680 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 116
[2024-11-08 17:12:17,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-08 17:12:17,682 INFO L225 Difference]: With dead ends: 230
[2024-11-08 17:12:17,683 INFO L226 Difference]: Without dead ends: 152
[2024-11-08 17:12:17,688 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2024-11-08 17:12:17,689 INFO L432 NwaCegarLoop]: 137 mSDtfsCounter, 213 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 213 SdHoareTripleChecker+Valid, 175 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time
[2024-11-08 17:12:17,692 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [213 Valid, 175 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time]
[2024-11-08 17:12:17,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states.
[2024-11-08 17:12:17,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 101.
[2024-11-08 17:12:17,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 83 states have (on average 1.3975903614457832) internal successors, (116), 83 states have internal predecessors, (116), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16)
[2024-11-08 17:12:17,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 148 transitions.
[2024-11-08 17:12:17,729 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 148 transitions. Word has length 116
[2024-11-08 17:12:17,730 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-08 17:12:17,730 INFO L471 AbstractCegarLoop]: Abstraction has 101 states and 148 transitions.
[2024-11-08 17:12:17,730 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16)
[2024-11-08 17:12:17,731 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 148 transitions.
[2024-11-08 17:12:17,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117
[2024-11-08 17:12:17,733 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-08 17:12:17,733 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-08 17:12:17,733 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2024-11-08 17:12:17,734 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-08 17:12:17,734 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 17:12:17,735 INFO L85 PathProgramCache]: Analyzing trace with hash -1900829423, now seen corresponding path program 1 times
[2024-11-08 17:12:17,735 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-08 17:12:17,735 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1634306444]
[2024-11-08 17:12:17,735 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 17:12:17,736 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-08 17:12:17,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:12:18,432 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5
[2024-11-08 17:12:18,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:12:18,435 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10
[2024-11-08 17:12:18,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:12:18,440 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16
[2024-11-08 17:12:18,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:12:18,446 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21
[2024-11-08 17:12:18,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:12:18,452 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27
[2024-11-08 17:12:18,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:12:18,456 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32
[2024-11-08 17:12:18,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:12:18,461 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38
[2024-11-08 17:12:18,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:12:18,465 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44
[2024-11-08 17:12:18,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:12:18,476 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50
[2024-11-08 17:12:18,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:12:18,479 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56
[2024-11-08 17:12:18,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:12:18,483 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62
[2024-11-08 17:12:18,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:12:18,486 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68
[2024-11-08 17:12:18,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:12:18,490 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74
[2024-11-08 17:12:18,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:12:18,494 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79
[2024-11-08 17:12:18,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:12:18,497 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85
[2024-11-08 17:12:18,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:12:18,501 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90
[2024-11-08 17:12:18,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:12:18,505 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked.
[2024-11-08 17:12:18,506 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-08 17:12:18,506 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1634306444]
[2024-11-08 17:12:18,506 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1634306444] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-08 17:12:18,506 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-08 17:12:18,507 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-11-08 17:12:18,507 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [297785125]
[2024-11-08 17:12:18,507 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-08 17:12:18,509 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2024-11-08 17:12:18,511 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-08 17:12:18,512 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2024-11-08 17:12:18,512 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20
[2024-11-08 17:12:18,512 INFO L87 Difference]: Start difference. First operand 101 states and 148 transitions. Second operand has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16)
[2024-11-08 17:12:18,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-08 17:12:18,843 INFO L93 Difference]: Finished difference Result 292 states and 426 transitions.
[2024-11-08 17:12:18,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states.
[2024-11-08 17:12:18,844 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 116
[2024-11-08 17:12:18,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-08 17:12:18,847 INFO L225 Difference]: With dead ends: 292
[2024-11-08 17:12:18,851 INFO L226 Difference]: Without dead ends: 194
[2024-11-08 17:12:18,852 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20
[2024-11-08 17:12:18,853 INFO L432 NwaCegarLoop]: 190 mSDtfsCounter, 257 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 257 SdHoareTripleChecker+Valid, 277 SdHoareTripleChecker+Invalid, 119 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time
[2024-11-08 17:12:18,854 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [257 Valid, 277 Invalid, 119 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time]
[2024-11-08 17:12:18,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states.
[2024-11-08 17:12:18,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 112.
[2024-11-08 17:12:18,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 94 states have (on average 1.3829787234042554) internal successors, (130), 94 states have internal predecessors, (130), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16)
[2024-11-08 17:12:18,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 162 transitions.
[2024-11-08 17:12:18,881 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 162 transitions. Word has length 116
[2024-11-08 17:12:18,881 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-08 17:12:18,882 INFO L471 AbstractCegarLoop]: Abstraction has 112 states and 162 transitions.
[2024-11-08 17:12:18,882 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16)
[2024-11-08 17:12:18,882 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 162 transitions.
[2024-11-08 17:12:18,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118
[2024-11-08 17:12:18,884 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-08 17:12:18,885 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-08 17:12:18,885 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2024-11-08 17:12:18,885 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-08 17:12:18,886 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 17:12:18,886 INFO L85 PathProgramCache]: Analyzing trace with hash -1817706875, now seen corresponding path program 1 times
[2024-11-08 17:12:18,886 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-08 17:12:18,886 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1531412596]
[2024-11-08 17:12:18,886 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 17:12:18,887 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-08 17:12:18,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:12:19,251 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5
[2024-11-08 17:12:19,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:12:19,255 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10
[2024-11-08 17:12:19,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:12:19,260 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16
[2024-11-08 17:12:19,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:12:19,263 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21
[2024-11-08 17:12:19,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:12:19,266 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27
[2024-11-08 17:12:19,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:12:19,269 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32
[2024-11-08 17:12:19,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:12:19,273 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38
[2024-11-08 17:12:19,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:12:19,276 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44
[2024-11-08 17:12:19,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:12:19,281 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50
[2024-11-08 17:12:19,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:12:19,285 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56
[2024-11-08 17:12:19,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:12:19,289 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62
[2024-11-08 17:12:19,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:12:19,292 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68
[2024-11-08 17:12:19,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:12:19,296 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74
[2024-11-08 17:12:19,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:12:19,300 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79
[2024-11-08 17:12:19,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:12:19,308 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85
[2024-11-08 17:12:19,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:12:19,311 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90
[2024-11-08 17:12:19,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:12:19,315 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked.
[2024-11-08 17:12:19,315 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-08 17:12:19,315 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1531412596]
[2024-11-08 17:12:19,315 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1531412596] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-08 17:12:19,316 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-08 17:12:19,316 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2024-11-08 17:12:19,316 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [68634832]
[2024-11-08 17:12:19,316 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-08 17:12:19,317 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2024-11-08 17:12:19,317 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-08 17:12:19,317 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2024-11-08 17:12:19,317 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2024-11-08 17:12:19,318 INFO L87 Difference]: Start difference. First operand 112 states and 162 transitions. Second operand has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16)
[2024-11-08 17:12:19,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-08 17:12:19,688 INFO L93 Difference]: Finished difference Result 322 states and 466 transitions.
[2024-11-08 17:12:19,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states.
[2024-11-08 17:12:19,689 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 117
[2024-11-08 17:12:19,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-08 17:12:19,691 INFO L225 Difference]: With dead ends: 322
[2024-11-08 17:12:19,691 INFO L226 Difference]: Without dead ends: 213
[2024-11-08 17:12:19,692 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20
[2024-11-08 17:12:19,693 INFO L432 NwaCegarLoop]: 70 mSDtfsCounter, 211 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 66 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 211 SdHoareTripleChecker+Valid, 104 SdHoareTripleChecker+Invalid, 156 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time
[2024-11-08 17:12:19,694 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [211 Valid, 104 Invalid, 156 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [66 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time]
[2024-11-08 17:12:19,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states.
[2024-11-08 17:12:19,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 114.
[2024-11-08 17:12:19,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 96 states have (on average 1.375) internal successors, (132), 96 states have internal predecessors, (132), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16)
[2024-11-08 17:12:19,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 164 transitions.
[2024-11-08 17:12:19,723 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 164 transitions. Word has length 117
[2024-11-08 17:12:19,724 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-08 17:12:19,724 INFO L471 AbstractCegarLoop]: Abstraction has 114 states and 164 transitions.
[2024-11-08 17:12:19,724 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16)
[2024-11-08 17:12:19,724 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 164 transitions.
[2024-11-08 17:12:19,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118
[2024-11-08 17:12:19,726 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-08 17:12:19,727 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-08 17:12:19,727 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2024-11-08 17:12:19,727 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-08 17:12:19,727 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 17:12:19,728 INFO L85 PathProgramCache]: Analyzing trace with hash -1230900861, now seen corresponding path program 1 times
[2024-11-08 17:12:19,728 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-08 17:12:19,728 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [203746481]
[2024-11-08 17:12:19,728 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 17:12:19,729 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-08 17:12:19,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:12:20,756 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5
[2024-11-08 17:12:20,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:12:20,759 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10
[2024-11-08 17:12:20,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:12:20,762 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16
[2024-11-08 17:12:20,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:12:20,768 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21
[2024-11-08 17:12:20,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:12:20,771 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27
[2024-11-08 17:12:20,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:12:20,773 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32
[2024-11-08 17:12:20,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:12:20,776 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38
[2024-11-08 17:12:20,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:12:20,779 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44
[2024-11-08 17:12:20,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:12:20,783 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50
[2024-11-08 17:12:20,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:12:20,786 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56
[2024-11-08 17:12:20,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:12:20,789 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62
[2024-11-08 17:12:20,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:12:20,793 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68
[2024-11-08 17:12:20,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:12:20,795 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74
[2024-11-08 17:12:20,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:12:20,798 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79
[2024-11-08 17:12:20,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:12:20,801 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85
[2024-11-08 17:12:20,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:12:20,804 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90
[2024-11-08 17:12:20,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:12:20,809 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked.
[2024-11-08 17:12:20,809 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-08 17:12:20,809 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [203746481]
[2024-11-08 17:12:20,809 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [203746481] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-08 17:12:20,810 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-08 17:12:20,811 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-11-08 17:12:20,811 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [564659908]
[2024-11-08 17:12:20,811 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-08 17:12:20,812 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-11-08 17:12:20,812 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-08 17:12:20,813 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-11-08 17:12:20,813 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56
[2024-11-08 17:12:20,813 INFO L87 Difference]: Start difference. First operand 114 states and 164 transitions. Second operand has 8 states, 8 states have (on average 5.0) internal successors, (40), 8 states have internal predecessors, (40), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16)
[2024-11-08 17:12:21,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-08 17:12:21,666 INFO L93 Difference]: Finished difference Result 319 states and 460 transitions.
[2024-11-08 17:12:21,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states.
[2024-11-08 17:12:21,667 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.0) internal successors, (40), 8 states have internal predecessors, (40), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 117
[2024-11-08 17:12:21,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-08 17:12:21,669 INFO L225 Difference]: With dead ends: 319
[2024-11-08 17:12:21,669 INFO L226 Difference]: Without dead ends: 208
[2024-11-08 17:12:21,670 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90
[2024-11-08 17:12:21,671 INFO L432 NwaCegarLoop]: 193 mSDtfsCounter, 160 mSDsluCounter, 661 mSDsCounter, 0 mSdLazyCounter, 441 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 160 SdHoareTripleChecker+Valid, 854 SdHoareTripleChecker+Invalid, 441 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 441 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time
[2024-11-08 17:12:21,672 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [160 Valid, 854 Invalid, 441 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 441 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time]
[2024-11-08 17:12:21,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states.
[2024-11-08 17:12:21,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 125.
[2024-11-08 17:12:21,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 107 states have (on average 1.3831775700934579) internal successors, (148), 107 states have internal predecessors, (148), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16)
[2024-11-08 17:12:21,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 180 transitions.
[2024-11-08 17:12:21,705 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 180 transitions. Word has length 117
[2024-11-08 17:12:21,706 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-08 17:12:21,706 INFO L471 AbstractCegarLoop]: Abstraction has 125 states and 180 transitions.
[2024-11-08 17:12:21,707 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.0) internal successors, (40), 8 states have internal predecessors, (40), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16)
[2024-11-08 17:12:21,707 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 180 transitions.
[2024-11-08 17:12:21,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119
[2024-11-08 17:12:21,709 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-08 17:12:21,709 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-08 17:12:21,709 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5
[2024-11-08 17:12:21,710 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-08 17:12:21,710 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 17:12:21,710 INFO L85 PathProgramCache]: Analyzing trace with hash -2044136425, now seen corresponding path program 1 times
[2024-11-08 17:12:21,710 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-08 17:12:21,711 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1206357767]
[2024-11-08 17:12:21,711 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 17:12:21,711 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-08 17:12:21,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:12:22,280 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5
[2024-11-08 17:12:22,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:12:22,282 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10
[2024-11-08 17:12:22,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:12:22,286 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16
[2024-11-08 17:12:22,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:12:22,288 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21
[2024-11-08 17:12:22,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:12:22,291 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27
[2024-11-08 17:12:22,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:12:22,294 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32
[2024-11-08 17:12:22,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:12:22,297 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38
[2024-11-08 17:12:22,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:12:22,301 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44
[2024-11-08 17:12:22,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:12:22,304 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50
[2024-11-08 17:12:22,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:12:22,307 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56
[2024-11-08 17:12:22,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:12:22,310 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62
[2024-11-08 17:12:22,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:12:22,313 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68
[2024-11-08 17:12:22,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:12:22,316 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74
[2024-11-08 17:12:22,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:12:22,319 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79
[2024-11-08 17:12:22,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:12:22,322 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85
[2024-11-08 17:12:22,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:12:22,326 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90
[2024-11-08 17:12:22,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:12:22,330 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked.
[2024-11-08 17:12:22,330 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-08 17:12:22,331 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1206357767]
[2024-11-08 17:12:22,331 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1206357767] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-08 17:12:22,331 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-08 17:12:22,331 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-11-08 17:12:22,332 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2077313416]
[2024-11-08 17:12:22,332 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-08 17:12:22,332 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-11-08 17:12:22,333 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-08 17:12:22,333 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-11-08 17:12:22,334 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56
[2024-11-08 17:12:22,334 INFO L87 Difference]: Start difference. First operand 125 states and 180 transitions. Second operand has 8 states, 8 states have (on average 5.125) internal successors, (41), 8 states have internal predecessors, (41), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16)
[2024-11-08 17:12:22,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-08 17:12:22,800 INFO L93 Difference]: Finished difference Result 308 states and 441 transitions.
[2024-11-08 17:12:22,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states.
[2024-11-08 17:12:22,801 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.125) internal successors, (41), 8 states have internal predecessors, (41), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 118
[2024-11-08 17:12:22,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-08 17:12:22,803 INFO L225 Difference]: With dead ends: 308
[2024-11-08 17:12:22,803 INFO L226 Difference]: Without dead ends: 186
[2024-11-08 17:12:22,804 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90
[2024-11-08 17:12:22,805 INFO L432 NwaCegarLoop]: 149 mSDtfsCounter, 67 mSDsluCounter, 698 mSDsCounter, 0 mSdLazyCounter, 228 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 847 SdHoareTripleChecker+Invalid, 229 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 228 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time
[2024-11-08 17:12:22,806 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 847 Invalid, 229 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 228 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time]
[2024-11-08 17:12:22,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states.
[2024-11-08 17:12:22,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 140.
[2024-11-08 17:12:22,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 140 states, 122 states have (on average 1.3770491803278688) internal successors, (168), 122 states have internal predecessors, (168), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16)
[2024-11-08 17:12:22,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 200 transitions.
[2024-11-08 17:12:22,843 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 200 transitions. Word has length 118
[2024-11-08 17:12:22,844 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-08 17:12:22,844 INFO L471 AbstractCegarLoop]: Abstraction has 140 states and 200 transitions.
[2024-11-08 17:12:22,845 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.125) internal successors, (41), 8 states have internal predecessors, (41), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16)
[2024-11-08 17:12:22,845 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 200 transitions.
[2024-11-08 17:12:22,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119
[2024-11-08 17:12:22,847 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-08 17:12:22,847 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-08 17:12:22,847 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6
[2024-11-08 17:12:22,848 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-08 17:12:22,848 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 17:12:22,848 INFO L85 PathProgramCache]: Analyzing trace with hash -829207142, now seen corresponding path program 1 times
[2024-11-08 17:12:22,848 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-08 17:12:22,849 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [565395216]
[2024-11-08 17:12:22,849 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 17:12:22,849 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-08 17:12:22,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:12:22,959 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5
[2024-11-08 17:12:22,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:12:22,962 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10
[2024-11-08 17:12:22,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:12:22,965 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16
[2024-11-08 17:12:22,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:12:22,968 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21
[2024-11-08 17:12:22,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:12:22,971 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27
[2024-11-08 17:12:22,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:12:22,973 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32
[2024-11-08 17:12:22,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:12:22,977 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38
[2024-11-08 17:12:22,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:12:22,980 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44
[2024-11-08 17:12:22,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:12:22,983 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50
[2024-11-08 17:12:22,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:12:22,986 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56
[2024-11-08 17:12:22,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:12:22,989 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62
[2024-11-08 17:12:22,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:12:22,993 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68
[2024-11-08 17:12:22,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:12:22,996 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74
[2024-11-08 17:12:22,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:12:23,000 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79
[2024-11-08 17:12:23,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:12:23,002 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85
[2024-11-08 17:12:23,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:12:23,006 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90
[2024-11-08 17:12:23,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:12:23,009 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked.
[2024-11-08 17:12:23,009 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-08 17:12:23,010 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [565395216]
[2024-11-08 17:12:23,010 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [565395216] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-08 17:12:23,010 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-08 17:12:23,010 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2024-11-08 17:12:23,011 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1442168312]
[2024-11-08 17:12:23,011 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-08 17:12:23,011 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-11-08 17:12:23,011 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-08 17:12:23,012 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-11-08 17:12:23,012 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-11-08 17:12:23,013 INFO L87 Difference]: Start difference. First operand 140 states and 200 transitions. Second operand has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16)
[2024-11-08 17:12:23,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-08 17:12:23,150 INFO L93 Difference]: Finished difference Result 334 states and 476 transitions.
[2024-11-08 17:12:23,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2024-11-08 17:12:23,151 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 118
[2024-11-08 17:12:23,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-08 17:12:23,155 INFO L225 Difference]: With dead ends: 334
[2024-11-08 17:12:23,155 INFO L226 Difference]: Without dead ends: 197
[2024-11-08 17:12:23,156 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-11-08 17:12:23,161 INFO L432 NwaCegarLoop]: 156 mSDtfsCounter, 70 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 237 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2024-11-08 17:12:23,161 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 237 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2024-11-08 17:12:23,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states.
[2024-11-08 17:12:23,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 149.
[2024-11-08 17:12:23,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 149 states, 131 states have (on average 1.366412213740458) internal successors, (179), 131 states have internal predecessors, (179), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16)
[2024-11-08 17:12:23,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 211 transitions.
[2024-11-08 17:12:23,215 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 211 transitions. Word has length 118
[2024-11-08 17:12:23,216 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-08 17:12:23,216 INFO L471 AbstractCegarLoop]: Abstraction has 149 states and 211 transitions.
[2024-11-08 17:12:23,216 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16)
[2024-11-08 17:12:23,217 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 211 transitions.
[2024-11-08 17:12:23,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119
[2024-11-08 17:12:23,218 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-08 17:12:23,219 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-08 17:12:23,219 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7
[2024-11-08 17:12:23,219 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-08 17:12:23,219 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 17:12:23,220 INFO L85 PathProgramCache]: Analyzing trace with hash 1731889742, now seen corresponding path program 1 times
[2024-11-08 17:12:23,220 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-08 17:12:23,220 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1996659975]
[2024-11-08 17:12:23,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 17:12:23,220 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-08 17:12:23,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:12:23,827 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5
[2024-11-08 17:12:23,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:12:23,830 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10
[2024-11-08 17:12:23,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:12:23,833 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16
[2024-11-08 17:12:23,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:12:23,836 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21
[2024-11-08 17:12:23,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:12:23,838 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27
[2024-11-08 17:12:23,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:12:23,841 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32
[2024-11-08 17:12:23,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:12:23,845 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38
[2024-11-08 17:12:23,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:12:23,851 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44
[2024-11-08 17:12:23,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:12:23,855 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50
[2024-11-08 17:12:23,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:12:23,858 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56
[2024-11-08 17:12:23,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:12:23,861 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62
[2024-11-08 17:12:23,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:12:23,866 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68
[2024-11-08 17:12:23,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:12:23,869 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74
[2024-11-08 17:12:23,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:12:23,871 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79
[2024-11-08 17:12:23,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:12:23,874 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85
[2024-11-08 17:12:23,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:12:23,877 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90
[2024-11-08 17:12:23,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:12:23,881 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked.
[2024-11-08 17:12:23,881 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-08 17:12:23,882 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1996659975]
[2024-11-08 17:12:23,882 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1996659975] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-08 17:12:23,882 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-08 17:12:23,882 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-11-08 17:12:23,882 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2031835163]
[2024-11-08 17:12:23,883 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-08 17:12:23,883 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-11-08 17:12:23,883 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-08 17:12:23,884 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-11-08 17:12:23,884 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56
[2024-11-08 17:12:23,885 INFO L87 Difference]: Start difference. First operand 149 states and 211 transitions. Second operand has 8 states, 8 states have (on average 5.125) internal successors, (41), 8 states have internal predecessors, (41), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16)
[2024-11-08 17:12:24,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-08 17:12:24,534 INFO L93 Difference]: Finished difference Result 358 states and 493 transitions.
[2024-11-08 17:12:24,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states.
[2024-11-08 17:12:24,536 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.125) internal successors, (41), 8 states have internal predecessors, (41), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 118
[2024-11-08 17:12:24,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-08 17:12:24,538 INFO L225 Difference]: With dead ends: 358
[2024-11-08 17:12:24,538 INFO L226 Difference]: Without dead ends: 212
[2024-11-08 17:12:24,539 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90
[2024-11-08 17:12:24,540 INFO L432 NwaCegarLoop]: 121 mSDtfsCounter, 74 mSDsluCounter, 514 mSDsCounter, 0 mSdLazyCounter, 293 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 635 SdHoareTripleChecker+Invalid, 301 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 293 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time
[2024-11-08 17:12:24,540 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 635 Invalid, 301 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 293 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time]
[2024-11-08 17:12:24,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states.
[2024-11-08 17:12:24,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 149.
[2024-11-08 17:12:24,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 149 states, 131 states have (on average 1.282442748091603) internal successors, (168), 131 states have internal predecessors, (168), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16)
[2024-11-08 17:12:24,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 200 transitions.
[2024-11-08 17:12:24,581 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 200 transitions. Word has length 118
[2024-11-08 17:12:24,582 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-08 17:12:24,582 INFO L471 AbstractCegarLoop]: Abstraction has 149 states and 200 transitions.
[2024-11-08 17:12:24,582 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.125) internal successors, (41), 8 states have internal predecessors, (41), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16)
[2024-11-08 17:12:24,583 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 200 transitions.
[2024-11-08 17:12:24,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120
[2024-11-08 17:12:24,584 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-08 17:12:24,585 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-08 17:12:24,585 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8
[2024-11-08 17:12:24,585 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-08 17:12:24,586 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 17:12:24,586 INFO L85 PathProgramCache]: Analyzing trace with hash -543711545, now seen corresponding path program 1 times
[2024-11-08 17:12:24,586 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-08 17:12:24,586 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [873559958]
[2024-11-08 17:12:24,586 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 17:12:24,587 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-08 17:12:24,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:12:25,086 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5
[2024-11-08 17:12:25,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:12:25,089 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10
[2024-11-08 17:12:25,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:12:25,092 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16
[2024-11-08 17:12:25,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:12:25,094 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21
[2024-11-08 17:12:25,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:12:25,098 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27
[2024-11-08 17:12:25,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:12:25,100 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32
[2024-11-08 17:12:25,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:12:25,103 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38
[2024-11-08 17:12:25,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:12:25,106 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44
[2024-11-08 17:12:25,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:12:25,119 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50
[2024-11-08 17:12:25,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:12:25,122 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56
[2024-11-08 17:12:25,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:12:25,125 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62
[2024-11-08 17:12:25,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:12:25,128 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68
[2024-11-08 17:12:25,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:12:25,131 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74
[2024-11-08 17:12:25,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:12:25,134 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79
[2024-11-08 17:12:25,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:12:25,137 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85
[2024-11-08 17:12:25,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:12:25,140 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90
[2024-11-08 17:12:25,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:12:25,143 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked.
[2024-11-08 17:12:25,144 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-08 17:12:25,144 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [873559958]
[2024-11-08 17:12:25,144 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [873559958] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-08 17:12:25,144 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-08 17:12:25,145 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-11-08 17:12:25,145 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1442581845]
[2024-11-08 17:12:25,145 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-08 17:12:25,146 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-11-08 17:12:25,146 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-08 17:12:25,146 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-11-08 17:12:25,147 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56
[2024-11-08 17:12:25,147 INFO L87 Difference]: Start difference. First operand 149 states and 200 transitions. Second operand has 8 states, 8 states have (on average 5.25) internal successors, (42), 8 states have internal predecessors, (42), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16)
[2024-11-08 17:12:26,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-08 17:12:26,410 INFO L93 Difference]: Finished difference Result 513 states and 692 transitions.
[2024-11-08 17:12:26,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states.
[2024-11-08 17:12:26,411 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.25) internal successors, (42), 8 states have internal predecessors, (42), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 119
[2024-11-08 17:12:26,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-08 17:12:26,414 INFO L225 Difference]: With dead ends: 513
[2024-11-08 17:12:26,414 INFO L226 Difference]: Without dead ends: 367
[2024-11-08 17:12:26,415 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=55, Invalid=101, Unknown=0, NotChecked=0, Total=156
[2024-11-08 17:12:26,416 INFO L432 NwaCegarLoop]: 129 mSDtfsCounter, 358 mSDsluCounter, 433 mSDsCounter, 0 mSdLazyCounter, 347 mSolverCounterSat, 195 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 358 SdHoareTripleChecker+Valid, 562 SdHoareTripleChecker+Invalid, 542 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 195 IncrementalHoareTripleChecker+Valid, 347 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time
[2024-11-08 17:12:26,416 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [358 Valid, 562 Invalid, 542 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [195 Valid, 347 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time]
[2024-11-08 17:12:26,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 367 states.
[2024-11-08 17:12:26,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 367 to 158.
[2024-11-08 17:12:26,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 158 states, 140 states have (on average 1.2785714285714285) internal successors, (179), 140 states have internal predecessors, (179), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16)
[2024-11-08 17:12:26,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 211 transitions.
[2024-11-08 17:12:26,466 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 211 transitions. Word has length 119
[2024-11-08 17:12:26,467 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-08 17:12:26,467 INFO L471 AbstractCegarLoop]: Abstraction has 158 states and 211 transitions.
[2024-11-08 17:12:26,468 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.25) internal successors, (42), 8 states have internal predecessors, (42), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16)
[2024-11-08 17:12:26,468 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 211 transitions.
[2024-11-08 17:12:26,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120
[2024-11-08 17:12:26,469 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-08 17:12:26,470 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-08 17:12:26,470 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9
[2024-11-08 17:12:26,470 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-08 17:12:26,471 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 17:12:26,471 INFO L85 PathProgramCache]: Analyzing trace with hash 136346825, now seen corresponding path program 1 times
[2024-11-08 17:12:26,471 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-08 17:12:26,471 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2017088570]
[2024-11-08 17:12:26,471 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 17:12:26,472 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-08 17:12:26,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:12:27,094 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5
[2024-11-08 17:12:27,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:12:27,098 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10
[2024-11-08 17:12:27,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:12:27,101 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16
[2024-11-08 17:12:27,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:12:27,104 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21
[2024-11-08 17:12:27,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:12:27,108 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27
[2024-11-08 17:12:27,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:12:27,111 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32
[2024-11-08 17:12:27,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:12:27,114 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38
[2024-11-08 17:12:27,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:12:27,117 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44
[2024-11-08 17:12:27,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:12:27,120 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50
[2024-11-08 17:12:27,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:12:27,124 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56
[2024-11-08 17:12:27,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:12:27,127 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62
[2024-11-08 17:12:27,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:12:27,130 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68
[2024-11-08 17:12:27,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:12:27,133 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74
[2024-11-08 17:12:27,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:12:27,136 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79
[2024-11-08 17:12:27,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:12:27,139 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85
[2024-11-08 17:12:27,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:12:27,142 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90
[2024-11-08 17:12:27,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:12:27,145 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked.
[2024-11-08 17:12:27,145 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-08 17:12:27,146 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2017088570]
[2024-11-08 17:12:27,146 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2017088570] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-08 17:12:27,146 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-08 17:12:27,146 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10
[2024-11-08 17:12:27,146 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [246315830]
[2024-11-08 17:12:27,147 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-08 17:12:27,147 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-11-08 17:12:27,147 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-08 17:12:27,148 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-11-08 17:12:27,148 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90
[2024-11-08 17:12:27,149 INFO L87 Difference]: Start difference. First operand 158 states and 211 transitions. Second operand has 10 states, 10 states have (on average 4.2) internal successors, (42), 10 states have internal predecessors, (42), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16)
[2024-11-08 17:12:27,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-08 17:12:27,585 INFO L93 Difference]: Finished difference Result 372 states and 488 transitions.
[2024-11-08 17:12:27,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states.
[2024-11-08 17:12:27,586 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.2) internal successors, (42), 10 states have internal predecessors, (42), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 119
[2024-11-08 17:12:27,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-08 17:12:27,587 INFO L225 Difference]: With dead ends: 372
[2024-11-08 17:12:27,588 INFO L226 Difference]: Without dead ends: 217
[2024-11-08 17:12:27,588 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132
[2024-11-08 17:12:27,589 INFO L432 NwaCegarLoop]: 119 mSDtfsCounter, 105 mSDsluCounter, 490 mSDsCounter, 0 mSdLazyCounter, 246 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 609 SdHoareTripleChecker+Invalid, 248 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 246 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time
[2024-11-08 17:12:27,589 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 609 Invalid, 248 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 246 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time]
[2024-11-08 17:12:27,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states.
[2024-11-08 17:12:27,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 148.
[2024-11-08 17:12:27,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 148 states, 130 states have (on average 1.2846153846153847) internal successors, (167), 130 states have internal predecessors, (167), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16)
[2024-11-08 17:12:27,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 199 transitions.
[2024-11-08 17:12:27,634 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 199 transitions. Word has length 119
[2024-11-08 17:12:27,634 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-08 17:12:27,634 INFO L471 AbstractCegarLoop]: Abstraction has 148 states and 199 transitions.
[2024-11-08 17:12:27,635 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.2) internal successors, (42), 10 states have internal predecessors, (42), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16)
[2024-11-08 17:12:27,635 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 199 transitions.
[2024-11-08 17:12:27,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120
[2024-11-08 17:12:27,636 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-08 17:12:27,637 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-08 17:12:27,637 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10
[2024-11-08 17:12:27,637 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-08 17:12:27,637 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 17:12:27,638 INFO L85 PathProgramCache]: Analyzing trace with hash 1814886226, now seen corresponding path program 1 times
[2024-11-08 17:12:27,638 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-08 17:12:27,638 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [701463096]
[2024-11-08 17:12:27,638 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 17:12:27,638 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-08 17:12:27,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:12:28,183 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5
[2024-11-08 17:12:28,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:12:28,186 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10
[2024-11-08 17:12:28,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:12:28,189 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16
[2024-11-08 17:12:28,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:12:28,191 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21
[2024-11-08 17:12:28,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:12:28,194 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27
[2024-11-08 17:12:28,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:12:28,196 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32
[2024-11-08 17:12:28,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:12:28,199 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38
[2024-11-08 17:12:28,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:12:28,202 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44
[2024-11-08 17:12:28,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:12:28,205 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50
[2024-11-08 17:12:28,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:12:28,208 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56
[2024-11-08 17:12:28,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:12:28,210 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62
[2024-11-08 17:12:28,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:12:28,213 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68
[2024-11-08 17:12:28,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:12:28,216 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74
[2024-11-08 17:12:28,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:12:28,219 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79
[2024-11-08 17:12:28,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:12:28,222 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85
[2024-11-08 17:12:28,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:12:28,225 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90
[2024-11-08 17:12:28,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:12:28,228 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked.
[2024-11-08 17:12:28,229 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-08 17:12:28,229 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [701463096]
[2024-11-08 17:12:28,229 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [701463096] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-08 17:12:28,229 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-08 17:12:28,230 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-11-08 17:12:28,230 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1754870969]
[2024-11-08 17:12:28,230 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-08 17:12:28,230 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-11-08 17:12:28,231 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-08 17:12:28,231 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-11-08 17:12:28,232 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56
[2024-11-08 17:12:28,232 INFO L87 Difference]: Start difference. First operand 148 states and 199 transitions. Second operand has 8 states, 8 states have (on average 5.25) internal successors, (42), 8 states have internal predecessors, (42), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16)
[2024-11-08 17:12:28,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-08 17:12:28,666 INFO L93 Difference]: Finished difference Result 341 states and 451 transitions.
[2024-11-08 17:12:28,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states.
[2024-11-08 17:12:28,667 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.25) internal successors, (42), 8 states have internal predecessors, (42), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 119
[2024-11-08 17:12:28,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-08 17:12:28,668 INFO L225 Difference]: With dead ends: 341
[2024-11-08 17:12:28,668 INFO L226 Difference]: Without dead ends: 196
[2024-11-08 17:12:28,669 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90
[2024-11-08 17:12:28,670 INFO L432 NwaCegarLoop]: 116 mSDtfsCounter, 56 mSDsluCounter, 336 mSDsCounter, 0 mSdLazyCounter, 189 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 452 SdHoareTripleChecker+Invalid, 191 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 189 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time
[2024-11-08 17:12:28,671 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 452 Invalid, 191 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 189 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time]
[2024-11-08 17:12:28,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states.
[2024-11-08 17:12:28,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 144.
[2024-11-08 17:12:28,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144 states, 126 states have (on average 1.2936507936507937) internal successors, (163), 126 states have internal predecessors, (163), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16)
[2024-11-08 17:12:28,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 195 transitions.
[2024-11-08 17:12:28,710 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 195 transitions. Word has length 119
[2024-11-08 17:12:28,710 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-08 17:12:28,711 INFO L471 AbstractCegarLoop]: Abstraction has 144 states and 195 transitions.
[2024-11-08 17:12:28,711 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.25) internal successors, (42), 8 states have internal predecessors, (42), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16)
[2024-11-08 17:12:28,711 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 195 transitions.
[2024-11-08 17:12:28,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120
[2024-11-08 17:12:28,713 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-08 17:12:28,713 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-08 17:12:28,713 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11
[2024-11-08 17:12:28,713 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-08 17:12:28,714 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 17:12:28,714 INFO L85 PathProgramCache]: Analyzing trace with hash 1966791614, now seen corresponding path program 1 times
[2024-11-08 17:12:28,714 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-08 17:12:28,714 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1019115342]
[2024-11-08 17:12:28,714 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 17:12:28,714 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-08 17:12:28,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:12:28,800 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5
[2024-11-08 17:12:28,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:12:28,802 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10
[2024-11-08 17:12:28,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:12:28,804 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16
[2024-11-08 17:12:28,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:12:28,806 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21
[2024-11-08 17:12:28,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:12:28,809 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27
[2024-11-08 17:12:28,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:12:28,811 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32
[2024-11-08 17:12:28,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:12:28,813 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38
[2024-11-08 17:12:28,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:12:28,815 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44
[2024-11-08 17:12:28,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:12:28,817 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50
[2024-11-08 17:12:28,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:12:28,819 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56
[2024-11-08 17:12:28,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:12:28,822 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62
[2024-11-08 17:12:28,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:12:28,824 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68
[2024-11-08 17:12:28,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:12:28,826 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74
[2024-11-08 17:12:28,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:12:28,828 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79
[2024-11-08 17:12:28,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:12:28,830 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85
[2024-11-08 17:12:28,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:12:28,833 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90
[2024-11-08 17:12:28,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:12:28,836 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked.
[2024-11-08 17:12:28,836 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-08 17:12:28,836 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1019115342]
[2024-11-08 17:12:28,836 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1019115342] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-08 17:12:28,837 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-08 17:12:28,837 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2024-11-08 17:12:28,837 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1429581435]
[2024-11-08 17:12:28,837 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-08 17:12:28,837 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-11-08 17:12:28,837 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-08 17:12:28,838 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-11-08 17:12:28,838 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-11-08 17:12:28,839 INFO L87 Difference]: Start difference. First operand 144 states and 195 transitions. Second operand has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16)
[2024-11-08 17:12:28,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-08 17:12:28,955 INFO L93 Difference]: Finished difference Result 339 states and 460 transitions.
[2024-11-08 17:12:28,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2024-11-08 17:12:28,956 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 119
[2024-11-08 17:12:28,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-08 17:12:28,958 INFO L225 Difference]: With dead ends: 339
[2024-11-08 17:12:28,958 INFO L226 Difference]: Without dead ends: 198
[2024-11-08 17:12:28,958 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-11-08 17:12:28,961 INFO L432 NwaCegarLoop]: 107 mSDtfsCounter, 83 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 182 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2024-11-08 17:12:28,962 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 182 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2024-11-08 17:12:28,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states.
[2024-11-08 17:12:29,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 151.
[2024-11-08 17:12:29,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 151 states, 133 states have (on average 1.2857142857142858) internal successors, (171), 133 states have internal predecessors, (171), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16)
[2024-11-08 17:12:29,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 203 transitions.
[2024-11-08 17:12:29,011 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 203 transitions. Word has length 119
[2024-11-08 17:12:29,011 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-08 17:12:29,011 INFO L471 AbstractCegarLoop]: Abstraction has 151 states and 203 transitions.
[2024-11-08 17:12:29,011 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16)
[2024-11-08 17:12:29,012 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 203 transitions.
[2024-11-08 17:12:29,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120
[2024-11-08 17:12:29,013 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-08 17:12:29,014 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-08 17:12:29,014 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12
[2024-11-08 17:12:29,014 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-08 17:12:29,014 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 17:12:29,014 INFO L85 PathProgramCache]: Analyzing trace with hash -893265984, now seen corresponding path program 1 times
[2024-11-08 17:12:29,015 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-08 17:12:29,015 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1359179720]
[2024-11-08 17:12:29,015 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 17:12:29,016 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-08 17:12:29,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:12:29,128 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5
[2024-11-08 17:12:29,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:12:29,131 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10
[2024-11-08 17:12:29,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:12:29,133 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16
[2024-11-08 17:12:29,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:12:29,136 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21
[2024-11-08 17:12:29,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:12:29,139 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27
[2024-11-08 17:12:29,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:12:29,141 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32
[2024-11-08 17:12:29,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:12:29,144 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38
[2024-11-08 17:12:29,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:12:29,147 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44
[2024-11-08 17:12:29,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:12:29,150 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50
[2024-11-08 17:12:29,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:12:29,153 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56
[2024-11-08 17:12:29,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:12:29,155 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62
[2024-11-08 17:12:29,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:12:29,158 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68
[2024-11-08 17:12:29,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:12:29,161 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74
[2024-11-08 17:12:29,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:12:29,182 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79
[2024-11-08 17:12:29,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:12:29,187 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85
[2024-11-08 17:12:29,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:12:29,191 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90
[2024-11-08 17:12:29,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:12:29,196 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked.
[2024-11-08 17:12:29,196 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-08 17:12:29,196 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1359179720]
[2024-11-08 17:12:29,197 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1359179720] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-08 17:12:29,197 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-08 17:12:29,197 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2024-11-08 17:12:29,197 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1851842002]
[2024-11-08 17:12:29,198 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-08 17:12:29,198 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-11-08 17:12:29,198 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-08 17:12:29,199 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-11-08 17:12:29,199 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-11-08 17:12:29,200 INFO L87 Difference]: Start difference. First operand 151 states and 203 transitions. Second operand has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16)
[2024-11-08 17:12:29,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-08 17:12:29,347 INFO L93 Difference]: Finished difference Result 345 states and 465 transitions.
[2024-11-08 17:12:29,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2024-11-08 17:12:29,349 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 119
[2024-11-08 17:12:29,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-08 17:12:29,351 INFO L225 Difference]: With dead ends: 345
[2024-11-08 17:12:29,351 INFO L226 Difference]: Without dead ends: 197
[2024-11-08 17:12:29,352 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-11-08 17:12:29,352 INFO L432 NwaCegarLoop]: 93 mSDtfsCounter, 76 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 170 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2024-11-08 17:12:29,353 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 170 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2024-11-08 17:12:29,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states.
[2024-11-08 17:12:29,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 151.
[2024-11-08 17:12:29,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 151 states, 133 states have (on average 1.263157894736842) internal successors, (168), 133 states have internal predecessors, (168), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16)
[2024-11-08 17:12:29,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 200 transitions.
[2024-11-08 17:12:29,411 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 200 transitions. Word has length 119
[2024-11-08 17:12:29,412 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-08 17:12:29,412 INFO L471 AbstractCegarLoop]: Abstraction has 151 states and 200 transitions.
[2024-11-08 17:12:29,412 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16)
[2024-11-08 17:12:29,413 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 200 transitions.
[2024-11-08 17:12:29,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121
[2024-11-08 17:12:29,415 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-08 17:12:29,415 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-08 17:12:29,415 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13
[2024-11-08 17:12:29,416 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-08 17:12:29,416 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 17:12:29,416 INFO L85 PathProgramCache]: Analyzing trace with hash -317111277, now seen corresponding path program 1 times
[2024-11-08 17:12:29,416 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-08 17:12:29,417 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1348935721]
[2024-11-08 17:12:29,417 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 17:12:29,417 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-08 17:12:29,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:12:30,167 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5
[2024-11-08 17:12:30,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:12:30,169 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10
[2024-11-08 17:12:30,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:12:30,172 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16
[2024-11-08 17:12:30,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:12:30,174 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21
[2024-11-08 17:12:30,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:12:30,177 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27
[2024-11-08 17:12:30,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:12:30,179 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32
[2024-11-08 17:12:30,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:12:30,181 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38
[2024-11-08 17:12:30,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:12:30,184 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44
[2024-11-08 17:12:30,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:12:30,187 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50
[2024-11-08 17:12:30,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:12:30,190 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56
[2024-11-08 17:12:30,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:12:30,192 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62
[2024-11-08 17:12:30,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:12:30,195 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68
[2024-11-08 17:12:30,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:12:30,197 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74
[2024-11-08 17:12:30,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:12:30,200 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79
[2024-11-08 17:12:30,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:12:30,202 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85
[2024-11-08 17:12:30,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:12:30,205 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90
[2024-11-08 17:12:30,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:12:30,208 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked.
[2024-11-08 17:12:30,208 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-08 17:12:30,209 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1348935721]
[2024-11-08 17:12:30,209 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1348935721] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-08 17:12:30,209 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-08 17:12:30,209 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-11-08 17:12:30,209 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1141418957]
[2024-11-08 17:12:30,210 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-08 17:12:30,210 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2024-11-08 17:12:30,210 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-08 17:12:30,211 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2024-11-08 17:12:30,211 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2024-11-08 17:12:30,211 INFO L87 Difference]: Start difference. First operand 151 states and 200 transitions. Second operand has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16)
[2024-11-08 17:12:30,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-08 17:12:30,447 INFO L93 Difference]: Finished difference Result 422 states and 554 transitions.
[2024-11-08 17:12:30,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states.
[2024-11-08 17:12:30,448 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 120
[2024-11-08 17:12:30,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-08 17:12:30,450 INFO L225 Difference]: With dead ends: 422
[2024-11-08 17:12:30,450 INFO L226 Difference]: Without dead ends: 274
[2024-11-08 17:12:30,451 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42
[2024-11-08 17:12:30,452 INFO L432 NwaCegarLoop]: 97 mSDtfsCounter, 55 mSDsluCounter, 163 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 260 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2024-11-08 17:12:30,452 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 260 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2024-11-08 17:12:30,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274 states.
[2024-11-08 17:12:30,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274 to 271.
[2024-11-08 17:12:30,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 271 states, 250 states have (on average 1.268) internal successors, (317), 251 states have internal predecessors, (317), 18 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18)
[2024-11-08 17:12:30,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 353 transitions.
[2024-11-08 17:12:30,507 INFO L78 Accepts]: Start accepts. Automaton has 271 states and 353 transitions. Word has length 120
[2024-11-08 17:12:30,507 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-08 17:12:30,508 INFO L471 AbstractCegarLoop]: Abstraction has 271 states and 353 transitions.
[2024-11-08 17:12:30,508 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16)
[2024-11-08 17:12:30,508 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 353 transitions.
[2024-11-08 17:12:30,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121
[2024-11-08 17:12:30,510 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-08 17:12:30,510 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-08 17:12:30,510 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14
[2024-11-08 17:12:30,511 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-08 17:12:30,511 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 17:12:30,511 INFO L85 PathProgramCache]: Analyzing trace with hash 1983711313, now seen corresponding path program 1 times
[2024-11-08 17:12:30,511 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-08 17:12:30,512 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1897916703]
[2024-11-08 17:12:30,512 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 17:12:30,512 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-08 17:12:30,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:12:31,047 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5
[2024-11-08 17:12:31,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:12:31,050 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10
[2024-11-08 17:12:31,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:12:31,052 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16
[2024-11-08 17:12:31,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:12:31,055 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21
[2024-11-08 17:12:31,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:12:31,057 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27
[2024-11-08 17:12:31,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:12:31,060 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32
[2024-11-08 17:12:31,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:12:31,062 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38
[2024-11-08 17:12:31,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:12:31,065 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44
[2024-11-08 17:12:31,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:12:31,067 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50
[2024-11-08 17:12:31,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:12:31,070 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56
[2024-11-08 17:12:31,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:12:31,073 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62
[2024-11-08 17:12:31,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:12:31,075 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68
[2024-11-08 17:12:31,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:12:31,078 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74
[2024-11-08 17:12:31,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:12:31,081 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79
[2024-11-08 17:12:31,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:12:31,083 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85
[2024-11-08 17:12:31,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:12:31,085 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90
[2024-11-08 17:12:31,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:12:31,088 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked.
[2024-11-08 17:12:31,089 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-08 17:12:31,089 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1897916703]
[2024-11-08 17:12:31,089 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1897916703] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-08 17:12:31,090 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-08 17:12:31,090 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10
[2024-11-08 17:12:31,090 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1600490313]
[2024-11-08 17:12:31,090 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-08 17:12:31,091 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-11-08 17:12:31,091 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-08 17:12:31,091 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-11-08 17:12:31,092 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90
[2024-11-08 17:12:31,092 INFO L87 Difference]: Start difference. First operand 271 states and 353 transitions. Second operand has 10 states, 10 states have (on average 4.3) internal successors, (43), 10 states have internal predecessors, (43), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16)
[2024-11-08 17:12:31,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-08 17:12:31,543 INFO L93 Difference]: Finished difference Result 623 states and 799 transitions.
[2024-11-08 17:12:31,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states.
[2024-11-08 17:12:31,544 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.3) internal successors, (43), 10 states have internal predecessors, (43), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 120
[2024-11-08 17:12:31,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-08 17:12:31,548 INFO L225 Difference]: With dead ends: 623
[2024-11-08 17:12:31,548 INFO L226 Difference]: Without dead ends: 355
[2024-11-08 17:12:31,549 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132
[2024-11-08 17:12:31,549 INFO L432 NwaCegarLoop]: 123 mSDtfsCounter, 50 mSDsluCounter, 759 mSDsCounter, 0 mSdLazyCounter, 299 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 882 SdHoareTripleChecker+Invalid, 299 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 299 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time
[2024-11-08 17:12:31,550 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 882 Invalid, 299 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 299 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time]
[2024-11-08 17:12:31,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 355 states.
[2024-11-08 17:12:31,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 355 to 243.
[2024-11-08 17:12:31,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 243 states, 222 states have (on average 1.2747747747747749) internal successors, (283), 223 states have internal predecessors, (283), 18 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18)
[2024-11-08 17:12:31,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 319 transitions.
[2024-11-08 17:12:31,598 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 319 transitions. Word has length 120
[2024-11-08 17:12:31,598 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-08 17:12:31,598 INFO L471 AbstractCegarLoop]: Abstraction has 243 states and 319 transitions.
[2024-11-08 17:12:31,599 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.3) internal successors, (43), 10 states have internal predecessors, (43), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16)
[2024-11-08 17:12:31,599 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 319 transitions.
[2024-11-08 17:12:31,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121
[2024-11-08 17:12:31,601 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-08 17:12:31,601 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-08 17:12:31,601 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15
[2024-11-08 17:12:31,601 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-08 17:12:31,602 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 17:12:31,602 INFO L85 PathProgramCache]: Analyzing trace with hash 137317776, now seen corresponding path program 1 times
[2024-11-08 17:12:31,602 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-08 17:12:31,602 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [219297555]
[2024-11-08 17:12:31,602 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 17:12:31,603 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-08 17:12:31,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:12:32,713 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5
[2024-11-08 17:12:32,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:12:32,717 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10
[2024-11-08 17:12:32,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:12:32,720 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16
[2024-11-08 17:12:32,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:12:32,722 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21
[2024-11-08 17:12:32,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:12:32,725 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27
[2024-11-08 17:12:32,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:12:32,727 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32
[2024-11-08 17:12:32,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:12:32,730 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38
[2024-11-08 17:12:32,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:12:32,733 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44
[2024-11-08 17:12:32,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:12:32,736 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50
[2024-11-08 17:12:32,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:12:32,740 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56
[2024-11-08 17:12:32,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:12:32,743 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62
[2024-11-08 17:12:32,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:12:32,746 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68
[2024-11-08 17:12:32,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:12:32,749 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74
[2024-11-08 17:12:32,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:12:32,752 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79
[2024-11-08 17:12:32,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:12:32,755 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85
[2024-11-08 17:12:32,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:12:32,759 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90
[2024-11-08 17:12:32,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:12:32,763 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked.
[2024-11-08 17:12:32,763 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-08 17:12:32,764 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [219297555]
[2024-11-08 17:12:32,764 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [219297555] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-08 17:12:32,764 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-08 17:12:32,764 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-11-08 17:12:32,765 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2141160061]
[2024-11-08 17:12:32,765 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-08 17:12:32,766 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2024-11-08 17:12:32,766 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-08 17:12:32,767 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2024-11-08 17:12:32,767 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42
[2024-11-08 17:12:32,768 INFO L87 Difference]: Start difference. First operand 243 states and 319 transitions. Second operand has 7 states, 7 states have (on average 6.142857142857143) internal successors, (43), 7 states have internal predecessors, (43), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16)
[2024-11-08 17:12:33,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-08 17:12:33,355 INFO L93 Difference]: Finished difference Result 503 states and 655 transitions.
[2024-11-08 17:12:33,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states.
[2024-11-08 17:12:33,356 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.142857142857143) internal successors, (43), 7 states have internal predecessors, (43), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 120
[2024-11-08 17:12:33,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-08 17:12:33,358 INFO L225 Difference]: With dead ends: 503
[2024-11-08 17:12:33,358 INFO L226 Difference]: Without dead ends: 263
[2024-11-08 17:12:33,358 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72
[2024-11-08 17:12:33,360 INFO L432 NwaCegarLoop]: 107 mSDtfsCounter, 136 mSDsluCounter, 337 mSDsCounter, 0 mSdLazyCounter, 187 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 136 SdHoareTripleChecker+Valid, 444 SdHoareTripleChecker+Invalid, 195 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 187 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time
[2024-11-08 17:12:33,360 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [136 Valid, 444 Invalid, 195 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 187 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time]
[2024-11-08 17:12:33,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 263 states.
[2024-11-08 17:12:33,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 263 to 243.
[2024-11-08 17:12:33,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 243 states, 222 states have (on average 1.2657657657657657) internal successors, (281), 223 states have internal predecessors, (281), 18 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18)
[2024-11-08 17:12:33,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 317 transitions.
[2024-11-08 17:12:33,407 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 317 transitions. Word has length 120
[2024-11-08 17:12:33,409 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-08 17:12:33,409 INFO L471 AbstractCegarLoop]: Abstraction has 243 states and 317 transitions.
[2024-11-08 17:12:33,409 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.142857142857143) internal successors, (43), 7 states have internal predecessors, (43), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16)
[2024-11-08 17:12:33,410 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 317 transitions.
[2024-11-08 17:12:33,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121
[2024-11-08 17:12:33,411 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-08 17:12:33,412 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-08 17:12:33,412 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16
[2024-11-08 17:12:33,412 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-08 17:12:33,412 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 17:12:33,413 INFO L85 PathProgramCache]: Analyzing trace with hash -1739976805, now seen corresponding path program 1 times
[2024-11-08 17:12:33,413 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-08 17:12:33,413 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [193650011]
[2024-11-08 17:12:33,413 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 17:12:33,413 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-08 17:12:33,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:12:33,830 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5
[2024-11-08 17:12:33,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:12:33,834 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10
[2024-11-08 17:12:33,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:12:33,839 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16
[2024-11-08 17:12:33,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:12:33,843 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21
[2024-11-08 17:12:33,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:12:33,848 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27
[2024-11-08 17:12:33,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:12:33,852 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32
[2024-11-08 17:12:33,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:12:33,857 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38
[2024-11-08 17:12:33,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:12:33,863 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44
[2024-11-08 17:12:33,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:12:33,869 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50
[2024-11-08 17:12:33,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:12:33,877 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56
[2024-11-08 17:12:33,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:12:33,883 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62
[2024-11-08 17:12:33,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:12:33,888 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68
[2024-11-08 17:12:33,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:12:33,894 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74
[2024-11-08 17:12:33,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:12:33,899 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79
[2024-11-08 17:12:33,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:12:33,904 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85
[2024-11-08 17:12:33,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:12:33,909 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90
[2024-11-08 17:12:33,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:12:33,914 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked.
[2024-11-08 17:12:33,918 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-08 17:12:33,918 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [193650011]
[2024-11-08 17:12:33,919 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [193650011] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-08 17:12:33,919 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-08 17:12:33,919 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-11-08 17:12:33,919 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1652180245]
[2024-11-08 17:12:33,919 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-08 17:12:33,920 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2024-11-08 17:12:33,920 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-08 17:12:33,920 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2024-11-08 17:12:33,920 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2024-11-08 17:12:33,921 INFO L87 Difference]: Start difference. First operand 243 states and 317 transitions. Second operand has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16)
[2024-11-08 17:12:34,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-08 17:12:34,229 INFO L93 Difference]: Finished difference Result 618 states and 812 transitions.
[2024-11-08 17:12:34,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states.
[2024-11-08 17:12:34,230 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 120
[2024-11-08 17:12:34,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-08 17:12:34,232 INFO L225 Difference]: With dead ends: 618
[2024-11-08 17:12:34,233 INFO L226 Difference]: Without dead ends: 378
[2024-11-08 17:12:34,233 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42
[2024-11-08 17:12:34,234 INFO L432 NwaCegarLoop]: 92 mSDtfsCounter, 89 mSDsluCounter, 233 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 325 SdHoareTripleChecker+Invalid, 114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time
[2024-11-08 17:12:34,235 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [89 Valid, 325 Invalid, 114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time]
[2024-11-08 17:12:34,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 378 states.
[2024-11-08 17:12:34,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 378 to 277.
[2024-11-08 17:12:34,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 277 states, 239 states have (on average 1.2468619246861925) internal successors, (298), 240 states have internal predecessors, (298), 34 states have call successors, (34), 3 states have call predecessors, (34), 3 states have return successors, (34), 33 states have call predecessors, (34), 34 states have call successors, (34)
[2024-11-08 17:12:34,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 277 states and 366 transitions.
[2024-11-08 17:12:34,329 INFO L78 Accepts]: Start accepts. Automaton has 277 states and 366 transitions. Word has length 120
[2024-11-08 17:12:34,329 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-08 17:12:34,330 INFO L471 AbstractCegarLoop]: Abstraction has 277 states and 366 transitions.
[2024-11-08 17:12:34,330 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16)
[2024-11-08 17:12:34,330 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 366 transitions.
[2024-11-08 17:12:34,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121
[2024-11-08 17:12:34,332 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-08 17:12:34,333 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-08 17:12:34,333 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17
[2024-11-08 17:12:34,333 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-08 17:12:34,333 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 17:12:34,334 INFO L85 PathProgramCache]: Analyzing trace with hash 1997448976, now seen corresponding path program 1 times
[2024-11-08 17:12:34,334 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-08 17:12:34,334 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2141972062]
[2024-11-08 17:12:34,334 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 17:12:34,334 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-08 17:12:34,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-08 17:12:34,411 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-11-08 17:12:34,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-08 17:12:34,563 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2024-11-08 17:12:34,563 INFO L325 BasicCegarLoop]: Counterexample is feasible
[2024-11-08 17:12:34,565 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining)
[2024-11-08 17:12:34,567 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18
[2024-11-08 17:12:34,570 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-08 17:12:34,695 INFO L170 ceAbstractionStarter]: Computing trace abstraction results
[2024-11-08 17:12:34,698 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.11 05:12:34 BoogieIcfgContainer
[2024-11-08 17:12:34,699 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction----------------------------
[2024-11-08 17:12:34,700 INFO L112 PluginConnector]: ------------------------Witness Printer----------------------------
[2024-11-08 17:12:34,700 INFO L270 PluginConnector]: Initializing Witness Printer...
[2024-11-08 17:12:34,700 INFO L274 PluginConnector]: Witness Printer initialized
[2024-11-08 17:12:34,701 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 05:12:15" (3/4) ...
[2024-11-08 17:12:34,705 INFO L145 WitnessPrinter]: No result that supports witness generation found
[2024-11-08 17:12:34,706 INFO L131 PluginConnector]: ------------------------ END Witness Printer----------------------------
[2024-11-08 17:12:34,707 INFO L158 Benchmark]: Toolchain (without parser) took 20867.96ms. Allocated memory was 153.1MB in the beginning and 295.7MB in the end (delta: 142.6MB). Free memory was 119.5MB in the beginning and 252.7MB in the end (delta: -133.2MB). Peak memory consumption was 11.8MB. Max. memory is 16.1GB.
[2024-11-08 17:12:34,707 INFO L158 Benchmark]: CDTParser took 0.41ms. Allocated memory is still 115.3MB. Free memory is still 69.2MB. There was no memory consumed. Max. memory is 16.1GB.
[2024-11-08 17:12:34,708 INFO L158 Benchmark]: CACSL2BoogieTranslator took 517.50ms. Allocated memory is still 153.1MB. Free memory was 119.1MB in the beginning and 103.0MB in the end (delta: 16.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB.
[2024-11-08 17:12:34,708 INFO L158 Benchmark]: Boogie Procedure Inliner took 85.36ms. Allocated memory is still 153.1MB. Free memory was 103.0MB in the beginning and 99.0MB in the end (delta: 4.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB.
[2024-11-08 17:12:34,708 INFO L158 Benchmark]: Boogie Preprocessor took 74.50ms. Allocated memory is still 153.1MB. Free memory was 99.0MB in the beginning and 93.8MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB.
[2024-11-08 17:12:34,709 INFO L158 Benchmark]: RCFGBuilder took 758.16ms. Allocated memory is still 153.1MB. Free memory was 93.8MB in the beginning and 70.8MB in the end (delta: 23.0MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB.
[2024-11-08 17:12:34,709 INFO L158 Benchmark]: TraceAbstraction took 19418.47ms. Allocated memory was 153.1MB in the beginning and 295.7MB in the end (delta: 142.6MB). Free memory was 70.1MB in the beginning and 252.7MB in the end (delta: -182.6MB). Peak memory consumption was 125.1MB. Max. memory is 16.1GB.
[2024-11-08 17:12:34,710 INFO L158 Benchmark]: Witness Printer took 6.52ms. Allocated memory is still 295.7MB. Free memory is still 252.7MB. There was no memory consumed. Max. memory is 16.1GB.
[2024-11-08 17:12:34,711 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] #######################
--- Results ---
* Results from de.uni_freiburg.informatik.ultimate.core:
- StatisticsResult: Toolchain Benchmarks
Benchmark results are:
* CDTParser took 0.41ms. Allocated memory is still 115.3MB. Free memory is still 69.2MB. There was no memory consumed. Max. memory is 16.1GB.
* CACSL2BoogieTranslator took 517.50ms. Allocated memory is still 153.1MB. Free memory was 119.1MB in the beginning and 103.0MB in the end (delta: 16.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB.
* Boogie Procedure Inliner took 85.36ms. Allocated memory is still 153.1MB. Free memory was 103.0MB in the beginning and 99.0MB in the end (delta: 4.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB.
* Boogie Preprocessor took 74.50ms. Allocated memory is still 153.1MB. Free memory was 99.0MB in the beginning and 93.8MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB.
* RCFGBuilder took 758.16ms. Allocated memory is still 153.1MB. Free memory was 93.8MB in the beginning and 70.8MB in the end (delta: 23.0MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB.
* TraceAbstraction took 19418.47ms. Allocated memory was 153.1MB in the beginning and 295.7MB in the end (delta: 142.6MB). Free memory was 70.1MB in the beginning and 252.7MB in the end (delta: -182.6MB). Peak memory consumption was 125.1MB. Max. memory is 16.1GB.
* Witness Printer took 6.52ms. Allocated memory is still 295.7MB. Free memory is still 252.7MB. There was no memory consumed. Max. memory is 16.1GB.
* Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction:
- StatisticsResult: ErrorAutomatonStatistics
NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0
- UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable
Unable to prove that a call to reach_error is unreachable
Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 124, overapproximation of someBinaryFLOATComparisonOperation at line 124.
Possible FailurePath:
[L21] unsigned char isInitial = 0;
[L22] signed long int var_1_1 = 64;
[L23] unsigned char var_1_7 = 0;
[L24] unsigned short int var_1_11 = 500;
[L25] unsigned char var_1_13 = 64;
[L26] unsigned char var_1_15 = 1;
[L27] unsigned char var_1_16 = 8;
[L28] double var_1_17 = 7.5;
[L29] double var_1_18 = 31.125;
[L30] double var_1_19 = 10.5;
[L31] double var_1_20 = 0.0;
[L32] double var_1_21 = 16.75;
[L33] double var_1_22 = 2.5;
[L34] double var_1_23 = 64.5;
[L35] signed long int var_1_24 = 10;
[L36] signed char var_1_26 = 16;
[L37] signed char var_1_27 = 4;
[L38] signed char var_1_28 = -10;
[L39] float var_1_29 = 63.794;
[L40] unsigned short int var_1_30 = 1;
[L41] signed long int var_1_31 = -2;
[L42] unsigned char var_1_32 = 64;
[L43] signed long int last_1_var_1_1 = 64;
[L44] unsigned char last_1_var_1_13 = 64;
VAL [isInitial=0, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=1, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0]
[L128] isInitial = 1
[L129] FCALL initially()
[L130] COND TRUE 1
[L131] CALL updateLastVariables()
[L120] last_1_var_1_1 = var_1_1
[L121] last_1_var_1_13 = var_1_13
VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=1, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0]
[L131] RET updateLastVariables()
[L132] CALL updateVariables()
[L91] var_1_7 = __VERIFIER_nondet_uchar()
[L92] CALL assume_abort_if_not(var_1_7 >= 0)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=1, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64]
[L20] COND FALSE !(!cond)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=1, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64]
[L92] RET assume_abort_if_not(var_1_7 >= 0)
VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=1, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64]
[L93] CALL assume_abort_if_not(var_1_7 <= 1)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=1, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0]
[L20] COND FALSE !(!cond)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=1, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0]
[L93] RET assume_abort_if_not(var_1_7 <= 1)
VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=1, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0]
[L94] var_1_15 = __VERIFIER_nondet_uchar()
[L95] CALL assume_abort_if_not(var_1_15 >= 0)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0]
[L20] COND FALSE !(!cond)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0]
[L95] RET assume_abort_if_not(var_1_15 >= 0)
VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0]
[L96] CALL assume_abort_if_not(var_1_15 <= 254)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=64, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0]
[L20] COND FALSE !(!cond)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=64, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0]
[L96] RET assume_abort_if_not(var_1_15 <= 254)
VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=64, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0]
[L97] var_1_16 = __VERIFIER_nondet_uchar()
[L98] CALL assume_abort_if_not(var_1_16 >= 0)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=64, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0]
[L20] COND FALSE !(!cond)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=64, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0]
[L98] RET assume_abort_if_not(var_1_16 >= 0)
VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=64, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0]
[L99] CALL assume_abort_if_not(var_1_16 <= 254)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=64, var_1_16=0, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0]
[L20] COND FALSE !(!cond)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=64, var_1_16=0, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0]
[L99] RET assume_abort_if_not(var_1_16 <= 254)
VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=64, var_1_16=0, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0]
[L100] var_1_18 = __VERIFIER_nondet_double()
[L101] CALL assume_abort_if_not((var_1_18 >= 0.0F && var_1_18 <= -1.0e-20F) || (var_1_18 <= 4611686.018427382800e+12F && var_1_18 >= 1.0e-20F ))
VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=64, var_1_16=0, var_1_17=15/2, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0]
[L20] COND FALSE !(!cond)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=64, var_1_16=0, var_1_17=15/2, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0]
[L101] RET assume_abort_if_not((var_1_18 >= 0.0F && var_1_18 <= -1.0e-20F) || (var_1_18 <= 4611686.018427382800e+12F && var_1_18 >= 1.0e-20F ))
VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=64, var_1_16=0, var_1_17=15/2, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0]
[L102] var_1_19 = __VERIFIER_nondet_double()
[L103] CALL assume_abort_if_not((var_1_19 >= 0.0F && var_1_19 <= -1.0e-20F) || (var_1_19 <= 4611686.018427382800e+12F && var_1_19 >= 1.0e-20F ))
VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=64, var_1_16=0, var_1_17=15/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0]
[L20] COND FALSE !(!cond)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=64, var_1_16=0, var_1_17=15/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0]
[L103] RET assume_abort_if_not((var_1_19 >= 0.0F && var_1_19 <= -1.0e-20F) || (var_1_19 <= 4611686.018427382800e+12F && var_1_19 >= 1.0e-20F ))
VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=64, var_1_16=0, var_1_17=15/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0]
[L104] var_1_20 = __VERIFIER_nondet_double()
[L105] CALL assume_abort_if_not((var_1_20 >= 4611686.018427382800e+12F && var_1_20 <= -1.0e-20F) || (var_1_20 <= 9223372.036854765600e+12F && var_1_20 >= 1.0e-20F ))
VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=64, var_1_16=0, var_1_17=15/2, var_1_1=64, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0]
[L20] COND FALSE !(!cond)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=64, var_1_16=0, var_1_17=15/2, var_1_1=64, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0]
[L105] RET assume_abort_if_not((var_1_20 >= 4611686.018427382800e+12F && var_1_20 <= -1.0e-20F) || (var_1_20 <= 9223372.036854765600e+12F && var_1_20 >= 1.0e-20F ))
VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=64, var_1_16=0, var_1_17=15/2, var_1_1=64, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0]
[L106] var_1_21 = __VERIFIER_nondet_double()
[L107] CALL assume_abort_if_not((var_1_21 >= 0.0F && var_1_21 <= -1.0e-20F) || (var_1_21 <= 4611686.018427382800e+12F && var_1_21 >= 1.0e-20F ))
VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=64, var_1_16=0, var_1_17=15/2, var_1_1=64, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0]
[L20] COND FALSE !(!cond)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=64, var_1_16=0, var_1_17=15/2, var_1_1=64, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0]
[L107] RET assume_abort_if_not((var_1_21 >= 0.0F && var_1_21 <= -1.0e-20F) || (var_1_21 <= 4611686.018427382800e+12F && var_1_21 >= 1.0e-20F ))
VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=64, var_1_16=0, var_1_17=15/2, var_1_1=64, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0]
[L108] var_1_22 = __VERIFIER_nondet_double()
[L109] CALL assume_abort_if_not((var_1_22 >= -922337.2036854765600e+13F && var_1_22 <= -1.0e-20F) || (var_1_22 <= 9223372.036854765600e+12F && var_1_22 >= 1.0e-20F ))
VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=64, var_1_16=0, var_1_17=15/2, var_1_1=64, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0]
[L20] COND FALSE !(!cond)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=64, var_1_16=0, var_1_17=15/2, var_1_1=64, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0]
[L109] RET assume_abort_if_not((var_1_22 >= -922337.2036854765600e+13F && var_1_22 <= -1.0e-20F) || (var_1_22 <= 9223372.036854765600e+12F && var_1_22 >= 1.0e-20F ))
VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=64, var_1_16=0, var_1_17=15/2, var_1_1=64, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0]
[L110] var_1_23 = __VERIFIER_nondet_double()
[L111] CALL assume_abort_if_not((var_1_23 >= -922337.2036854765600e+13F && var_1_23 <= -1.0e-20F) || (var_1_23 <= 9223372.036854765600e+12F && var_1_23 >= 1.0e-20F ))
VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=64, var_1_16=0, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0]
[L20] COND FALSE !(!cond)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=64, var_1_16=0, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0]
[L111] RET assume_abort_if_not((var_1_23 >= -922337.2036854765600e+13F && var_1_23 <= -1.0e-20F) || (var_1_23 <= 9223372.036854765600e+12F && var_1_23 >= 1.0e-20F ))
VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=64, var_1_16=0, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0]
[L112] var_1_27 = __VERIFIER_nondet_char()
[L113] CALL assume_abort_if_not(var_1_27 >= -63)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=64, var_1_16=0, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0]
[L20] COND FALSE !(!cond)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=64, var_1_16=0, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0]
[L113] RET assume_abort_if_not(var_1_27 >= -63)
VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=64, var_1_16=0, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0]
[L114] CALL assume_abort_if_not(var_1_27 <= 63)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=64, var_1_16=0, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0]
[L20] COND FALSE !(!cond)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=64, var_1_16=0, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0]
[L114] RET assume_abort_if_not(var_1_27 <= 63)
VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=64, var_1_16=0, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0]
[L115] var_1_28 = __VERIFIER_nondet_char()
[L116] CALL assume_abort_if_not(var_1_28 >= -63)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=64, var_1_16=0, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=-63, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0]
[L20] COND FALSE !(!cond)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=64, var_1_16=0, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=-63, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0]
[L116] RET assume_abort_if_not(var_1_28 >= -63)
VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=64, var_1_16=0, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=-63, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0]
[L117] CALL assume_abort_if_not(var_1_28 <= 63)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=64, var_1_16=0, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=-63, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0]
[L20] COND FALSE !(!cond)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=64, var_1_16=0, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=-63, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0]
[L117] RET assume_abort_if_not(var_1_28 <= 63)
VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=64, var_1_16=0, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=-63, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0]
[L132] RET updateVariables()
[L133] CALL step()
[L48] signed long int stepLocal_1 = last_1_var_1_1;
VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, stepLocal_1=64, var_1_11=500, var_1_13=64, var_1_15=64, var_1_16=0, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=-63, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0]
[L49] COND FALSE !(stepLocal_1 != last_1_var_1_13)
VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=64, var_1_16=0, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=-63, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0]
[L52] var_1_31 = var_1_13
VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=64, var_1_16=0, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=-63, var_1_29=31897/500, var_1_30=1, var_1_31=64, var_1_32=64, var_1_7=0]
[L53] COND FALSE !(\read(var_1_7))
[L56] var_1_17 = var_1_22
VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=64, var_1_16=0, var_1_17=505, var_1_1=64, var_1_22=505, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=-63, var_1_29=31897/500, var_1_30=1, var_1_31=64, var_1_32=64, var_1_7=0]
[L58] COND FALSE !(\read(var_1_7))
VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=64, var_1_16=0, var_1_17=505, var_1_1=64, var_1_22=505, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=-63, var_1_29=31897/500, var_1_30=1, var_1_31=64, var_1_32=64, var_1_7=0]
[L61] var_1_32 = var_1_16
[L62] var_1_30 = var_1_32
[L63] unsigned char stepLocal_0 = var_1_13;
VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, stepLocal_0=64, var_1_11=500, var_1_13=64, var_1_15=64, var_1_16=0, var_1_17=505, var_1_1=64, var_1_22=505, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=-63, var_1_29=31897/500, var_1_30=0, var_1_31=64, var_1_32=0, var_1_7=0]
[L64] EXPR var_1_32 >> var_1_32
VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, stepLocal_0=64, var_1_11=500, var_1_13=64, var_1_15=64, var_1_16=0, var_1_17=505, var_1_1=64, var_1_22=505, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=-63, var_1_29=31897/500, var_1_30=0, var_1_31=64, var_1_32=0, var_1_7=0]
[L64] COND TRUE (var_1_32 >> var_1_32) < stepLocal_0
[L65] var_1_11 = var_1_32
VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=0, var_1_13=64, var_1_15=64, var_1_16=0, var_1_17=505, var_1_1=64, var_1_22=505, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=-63, var_1_29=31897/500, var_1_30=0, var_1_31=64, var_1_32=0, var_1_7=0]
[L67] COND TRUE var_1_11 >= var_1_30
[L68] var_1_26 = (var_1_27 + var_1_28)
VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=0, var_1_13=64, var_1_15=64, var_1_16=0, var_1_17=505, var_1_1=64, var_1_22=505, var_1_24=10, var_1_26=-126, var_1_27=-63, var_1_28=-63, var_1_29=31897/500, var_1_30=0, var_1_31=64, var_1_32=0, var_1_7=0]
[L70] EXPR (var_1_31 + 4u) | var_1_30
VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=0, var_1_13=64, var_1_15=64, var_1_16=0, var_1_17=505, var_1_1=64, var_1_22=505, var_1_24=10, var_1_26=-126, var_1_27=-63, var_1_28=-63, var_1_29=31897/500, var_1_30=0, var_1_31=64, var_1_32=0, var_1_7=0]
[L70] COND TRUE 32u < ((var_1_31 + 4u) | var_1_30)
[L71] var_1_1 = (var_1_26 + (var_1_26 + var_1_32))
VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=0, var_1_13=64, var_1_15=64, var_1_16=0, var_1_17=505, var_1_1=-252, var_1_22=505, var_1_24=10, var_1_26=-126, var_1_27=-63, var_1_28=-63, var_1_29=31897/500, var_1_30=0, var_1_31=64, var_1_32=0, var_1_7=0]
[L79] unsigned short int stepLocal_2 = var_1_30;
VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, stepLocal_2=0, var_1_11=0, var_1_13=64, var_1_15=64, var_1_16=0, var_1_17=505, var_1_1=-252, var_1_22=505, var_1_24=10, var_1_26=-126, var_1_27=-63, var_1_28=-63, var_1_29=31897/500, var_1_30=0, var_1_31=64, var_1_32=0, var_1_7=0]
[L80] COND TRUE ! var_1_7
[L81] var_1_24 = (var_1_11 - ((((((((var_1_30) > (var_1_13)) ? (var_1_30) : (var_1_13)))) < ((var_1_30 + var_1_15))) ? (((((var_1_30) > (var_1_13)) ? (var_1_30) : (var_1_13)))) : ((var_1_30 + var_1_15)))))
VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, stepLocal_2=0, var_1_11=0, var_1_13=64, var_1_15=64, var_1_16=0, var_1_17=505, var_1_1=-252, var_1_22=505, var_1_24=-64, var_1_26=-126, var_1_27=-63, var_1_28=-63, var_1_29=31897/500, var_1_30=0, var_1_31=64, var_1_32=0, var_1_7=0]
[L133] RET step()
[L134] CALL, EXPR property()
[L124] EXPR (var_1_31 + 4u) | var_1_30
VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=0, var_1_13=64, var_1_15=64, var_1_16=0, var_1_17=505, var_1_1=-252, var_1_22=505, var_1_24=-64, var_1_26=-126, var_1_27=-63, var_1_28=-63, var_1_29=31897/500, var_1_30=0, var_1_31=64, var_1_32=0, var_1_7=0]
[L124] EXPR ((32u < ((var_1_31 + 4u) | var_1_30)) ? (var_1_1 == ((signed long int) (var_1_26 + (var_1_26 + var_1_32)))) : ((! var_1_7) ? (var_1_1 == ((signed long int) ((((var_1_26) < ((var_1_11 - var_1_32))) ? (var_1_26) : ((var_1_11 - var_1_32)))))) : (var_1_1 == ((signed long int) (var_1_32 - var_1_13))))) && (((var_1_32 >> var_1_32) < var_1_13) ? (var_1_11 == ((unsigned short int) var_1_32)) : 1)
VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=0, var_1_13=64, var_1_15=64, var_1_16=0, var_1_17=505, var_1_1=-252, var_1_22=505, var_1_24=-64, var_1_26=-126, var_1_27=-63, var_1_28=-63, var_1_29=31897/500, var_1_30=0, var_1_31=64, var_1_32=0, var_1_7=0]
[L124] EXPR var_1_32 >> var_1_32
VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=0, var_1_13=64, var_1_15=64, var_1_16=0, var_1_17=505, var_1_1=-252, var_1_22=505, var_1_24=-64, var_1_26=-126, var_1_27=-63, var_1_28=-63, var_1_29=31897/500, var_1_30=0, var_1_31=64, var_1_32=0, var_1_7=0]
[L124] EXPR ((32u < ((var_1_31 + 4u) | var_1_30)) ? (var_1_1 == ((signed long int) (var_1_26 + (var_1_26 + var_1_32)))) : ((! var_1_7) ? (var_1_1 == ((signed long int) ((((var_1_26) < ((var_1_11 - var_1_32))) ? (var_1_26) : ((var_1_11 - var_1_32)))))) : (var_1_1 == ((signed long int) (var_1_32 - var_1_13))))) && (((var_1_32 >> var_1_32) < var_1_13) ? (var_1_11 == ((unsigned short int) var_1_32)) : 1)
VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=0, var_1_13=64, var_1_15=64, var_1_16=0, var_1_17=505, var_1_1=-252, var_1_22=505, var_1_24=-64, var_1_26=-126, var_1_27=-63, var_1_28=-63, var_1_29=31897/500, var_1_30=0, var_1_31=64, var_1_32=0, var_1_7=0]
[L124-L125] return ((((((((((32u < ((var_1_31 + 4u) | var_1_30)) ? (var_1_1 == ((signed long int) (var_1_26 + (var_1_26 + var_1_32)))) : ((! var_1_7) ? (var_1_1 == ((signed long int) ((((var_1_26) < ((var_1_11 - var_1_32))) ? (var_1_26) : ((var_1_11 - var_1_32)))))) : (var_1_1 == ((signed long int) (var_1_32 - var_1_13))))) && (((var_1_32 >> var_1_32) < var_1_13) ? (var_1_11 == ((unsigned short int) var_1_32)) : 1)) && ((last_1_var_1_1 != last_1_var_1_13) ? (var_1_13 == ((unsigned char) ((((var_1_15) < (var_1_16)) ? (var_1_15) : (var_1_16))))) : 1)) && (var_1_7 ? (var_1_17 == ((double) ((((((var_1_18 + var_1_19) - (var_1_20 - var_1_21))) < (((((var_1_22) > (var_1_23)) ? (var_1_22) : (var_1_23))))) ? (((var_1_18 + var_1_19) - (var_1_20 - var_1_21))) : (((((var_1_22) > (var_1_23)) ? (var_1_22) : (var_1_23)))))))) : (var_1_17 == ((double) var_1_22)))) && ((! var_1_7) ? (var_1_24 == ((signed long int) (var_1_11 - ((((((((var_1_30) > (var_1_13)) ? (var_1_30) : (var_1_13)))) < ((var_1_30 + var_1_15))) ? (((((var_1_30) > (var_1_13)) ? (var_1_30) : (var_1_13)))) : ((var_1_30 + var_1_15))))))) : ((var_1_11 < var_1_30) ? (var_1_24 == ((signed long int) -4)) : (var_1_24 == ((signed long int) var_1_26))))) && ((var_1_11 >= var_1_30) ? (var_1_26 == ((signed char) (var_1_27 + var_1_28))) : 1)) && (var_1_7 ? (var_1_29 == ((float) var_1_20)) : 1)) && (var_1_30 == ((unsigned short int) var_1_32))) && (var_1_31 == ((signed long int) var_1_13))) && (var_1_32 == ((unsigned char) var_1_16))
;
[L134] RET, EXPR property()
[L134] CALL __VERIFIER_assert(property())
[L19] COND TRUE !(cond)
VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=0, var_1_13=64, var_1_15=64, var_1_16=0, var_1_17=505, var_1_1=-252, var_1_22=505, var_1_24=-64, var_1_26=-126, var_1_27=-63, var_1_28=-63, var_1_29=31897/500, var_1_30=0, var_1_31=64, var_1_32=0, var_1_7=0]
[L19] reach_error()
VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=0, var_1_13=64, var_1_15=64, var_1_16=0, var_1_17=505, var_1_1=-252, var_1_22=505, var_1_24=-64, var_1_26=-126, var_1_27=-63, var_1_28=-63, var_1_29=31897/500, var_1_30=0, var_1_31=64, var_1_32=0, var_1_7=0]
- StatisticsResult: Ultimate Automizer benchmark data
CFG has 2 procedures, 72 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 19.2s, OverallIterations: 19, TraceHistogramMax: 16, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 7.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2093 SdHoareTripleChecker+Valid, 5.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2093 mSDsluCounter, 7313 SdHoareTripleChecker+Invalid, 4.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 5100 mSDsCounter, 380 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2683 IncrementalHoareTripleChecker+Invalid, 3063 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 380 mSolverCounterUnsat, 2213 mSDtfsCounter, 2683 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 742 GetRequests, 650 SyntacticMatches, 0 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 2.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=277occurred in iteration=18, InterpolantAutomatonStates: 98, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.8s AutomataMinimizationTime, 18 MinimizatonAttempts, 1148 StatesRemovedByMinimization, 17 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 9.2s InterpolantComputationTime, 2247 NumberOfCodeBlocks, 2247 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 2109 ConstructedInterpolants, 0 QuantifiedInterpolants, 5242 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 18 InterpolantComputations, 18 PerfectInterpolantSequences, 8640/8640 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available
RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces
[2024-11-08 17:12:34,766 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22f3ce76-6050-4203-b56a-86e323d783ed/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0
Received shutdown request...
--- End real Ultimate output ---
Execution finished normally
Using bit-precise analysis
Retrying with bit-precise analysis
### Bit-precise run ###
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_22f3ce76-6050-4203-b56a-86e323d783ed/bin/uautomizer-verify-jihMAELWvX/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22f3ce76-6050-4203-b56a-86e323d783ed/bin/uautomizer-verify-jihMAELWvX/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22f3ce76-6050-4203-b56a-86e323d783ed/bin/uautomizer-verify-jihMAELWvX/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22f3ce76-6050-4203-b56a-86e323d783ed/bin/uautomizer-verify-jihMAELWvX/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_normal_file-63.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22f3ce76-6050-4203-b56a-86e323d783ed/bin/uautomizer-verify-jihMAELWvX/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22f3ce76-6050-4203-b56a-86e323d783ed/bin/uautomizer-verify-jihMAELWvX --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) )
--witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 22049259aa90ec31463fad29fa04047c315294147ab56d7684d575018f4c12a6
--- Real Ultimate output ---
This is Ultimate 0.2.5-dev-a016563
[2024-11-08 17:12:37,574 INFO L188 SettingsManager]: Resetting all preferences to default values...
[2024-11-08 17:12:37,685 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22f3ce76-6050-4203-b56a-86e323d783ed/bin/uautomizer-verify-jihMAELWvX/config/svcomp-Reach-32bit-Automizer_Bitvector.epf
[2024-11-08 17:12:37,692 WARN L101 SettingsManager]: Preference file contains the following unknown settings:
[2024-11-08 17:12:37,693 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2024-11-08 17:12:37,733 INFO L130 SettingsManager]: Preferences different from defaults after loading the file:
[2024-11-08 17:12:37,734 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2024-11-08 17:12:37,735 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2024-11-08 17:12:37,736 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults:
[2024-11-08 17:12:37,736 INFO L153 SettingsManager]: * Use memory slicer=true
[2024-11-08 17:12:37,737 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2024-11-08 17:12:37,737 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2024-11-08 17:12:37,738 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2024-11-08 17:12:37,739 INFO L153 SettingsManager]: * Create parallel compositions if possible=false
[2024-11-08 17:12:37,741 INFO L153 SettingsManager]: * Use SBE=true
[2024-11-08 17:12:37,742 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2024-11-08 17:12:37,745 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE
[2024-11-08 17:12:37,746 INFO L153 SettingsManager]: * sizeof long=4
[2024-11-08 17:12:37,746 INFO L153 SettingsManager]: * sizeof POINTER=4
[2024-11-08 17:12:37,746 INFO L153 SettingsManager]: * Check division by zero=IGNORE
[2024-11-08 17:12:37,747 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE
[2024-11-08 17:12:37,748 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE
[2024-11-08 17:12:37,748 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE
[2024-11-08 17:12:37,752 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true
[2024-11-08 17:12:37,753 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true
[2024-11-08 17:12:37,753 INFO L153 SettingsManager]: * Allow undefined functions=false
[2024-11-08 17:12:37,753 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution
[2024-11-08 17:12:37,754 INFO L153 SettingsManager]: * sizeof long double=12
[2024-11-08 17:12:37,754 INFO L153 SettingsManager]: * Check if freed pointer was valid=false
[2024-11-08 17:12:37,754 INFO L153 SettingsManager]: * Use constant arrays=true
[2024-11-08 17:12:37,755 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2024-11-08 17:12:37,755 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements
[2024-11-08 17:12:37,756 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true
[2024-11-08 17:12:37,758 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode
[2024-11-08 17:12:37,759 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-11-08 17:12:37,759 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2024-11-08 17:12:37,759 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP
[2024-11-08 17:12:37,760 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads
[2024-11-08 17:12:37,760 INFO L153 SettingsManager]: * Trace refinement strategy=FOX
[2024-11-08 17:12:37,761 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt
[2024-11-08 17:12:37,762 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false
[2024-11-08 17:12:37,762 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET
[2024-11-08 17:12:37,763 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO
[2024-11-08 17:12:37,764 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode
[2024-11-08 17:12:37,764 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_22f3ce76-6050-4203-b56a-86e323d783ed/bin/uautomizer-verify-jihMAELWvX/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int)
WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1
WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations
WARNING: All illegal access operations will be denied in a future release
Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22f3ce76-6050-4203-b56a-86e323d783ed/bin/uautomizer-verify-jihMAELWvX
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) )
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 22049259aa90ec31463fad29fa04047c315294147ab56d7684d575018f4c12a6
[2024-11-08 17:12:38,232 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp
[2024-11-08 17:12:38,271 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2024-11-08 17:12:38,275 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2024-11-08 17:12:38,277 INFO L270 PluginConnector]: Initializing CDTParser...
[2024-11-08 17:12:38,278 INFO L274 PluginConnector]: CDTParser initialized
[2024-11-08 17:12:38,279 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22f3ce76-6050-4203-b56a-86e323d783ed/bin/uautomizer-verify-jihMAELWvX/../../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_normal_file-63.i
Unable to find full path for "g++"
[2024-11-08 17:12:40,478 INFO L533 CDTParser]: Created temporary CDT project at NULL
[2024-11-08 17:12:40,748 INFO L384 CDTParser]: Found 1 translation units.
[2024-11-08 17:12:40,748 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22f3ce76-6050-4203-b56a-86e323d783ed/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_normal_file-63.i
[2024-11-08 17:12:40,759 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22f3ce76-6050-4203-b56a-86e323d783ed/bin/uautomizer-verify-jihMAELWvX/data/37adb27f9/7af41250ab074ef1854c71818ed57796/FLAG988681441
[2024-11-08 17:12:41,080 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22f3ce76-6050-4203-b56a-86e323d783ed/bin/uautomizer-verify-jihMAELWvX/data/37adb27f9/7af41250ab074ef1854c71818ed57796
[2024-11-08 17:12:41,082 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2024-11-08 17:12:41,084 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements.
[2024-11-08 17:12:41,086 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2024-11-08 17:12:41,086 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator...
[2024-11-08 17:12:41,094 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized
[2024-11-08 17:12:41,095 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 05:12:41" (1/1) ...
[2024-11-08 17:12:41,097 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@b0dee4c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:12:41, skipping insertion in model container
[2024-11-08 17:12:41,097 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 05:12:41" (1/1) ...
[2024-11-08 17:12:41,133 INFO L175 MainTranslator]: Built tables and reachable declarations
[2024-11-08 17:12:41,374 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22f3ce76-6050-4203-b56a-86e323d783ed/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_normal_file-63.i[913,926]
[2024-11-08 17:12:41,479 INFO L210 PostProcessor]: Analyzing one entry point: main
[2024-11-08 17:12:41,496 INFO L200 MainTranslator]: Completed pre-run
[2024-11-08 17:12:41,510 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22f3ce76-6050-4203-b56a-86e323d783ed/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_normal_file-63.i[913,926]
[2024-11-08 17:12:41,543 INFO L210 PostProcessor]: Analyzing one entry point: main
[2024-11-08 17:12:41,572 INFO L204 MainTranslator]: Completed translation
[2024-11-08 17:12:41,573 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:12:41 WrapperNode
[2024-11-08 17:12:41,573 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2024-11-08 17:12:41,575 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2024-11-08 17:12:41,575 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner...
[2024-11-08 17:12:41,575 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized
[2024-11-08 17:12:41,584 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:12:41" (1/1) ...
[2024-11-08 17:12:41,597 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:12:41" (1/1) ...
[2024-11-08 17:12:41,641 INFO L138 Inliner]: procedures = 27, calls = 29, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 134
[2024-11-08 17:12:41,641 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2024-11-08 17:12:41,642 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2024-11-08 17:12:41,642 INFO L270 PluginConnector]: Initializing Boogie Preprocessor...
[2024-11-08 17:12:41,642 INFO L274 PluginConnector]: Boogie Preprocessor initialized
[2024-11-08 17:12:41,660 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:12:41" (1/1) ...
[2024-11-08 17:12:41,660 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:12:41" (1/1) ...
[2024-11-08 17:12:41,668 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:12:41" (1/1) ...
[2024-11-08 17:12:41,688 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0].
[2024-11-08 17:12:41,689 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:12:41" (1/1) ...
[2024-11-08 17:12:41,692 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:12:41" (1/1) ...
[2024-11-08 17:12:41,734 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:12:41" (1/1) ...
[2024-11-08 17:12:41,740 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:12:41" (1/1) ...
[2024-11-08 17:12:41,746 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:12:41" (1/1) ...
[2024-11-08 17:12:41,752 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:12:41" (1/1) ...
[2024-11-08 17:12:41,756 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2024-11-08 17:12:41,761 INFO L112 PluginConnector]: ------------------------RCFGBuilder----------------------------
[2024-11-08 17:12:41,761 INFO L270 PluginConnector]: Initializing RCFGBuilder...
[2024-11-08 17:12:41,761 INFO L274 PluginConnector]: RCFGBuilder initialized
[2024-11-08 17:12:41,763 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:12:41" (1/1) ...
[2024-11-08 17:12:41,770 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-11-08 17:12:41,786 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22f3ce76-6050-4203-b56a-86e323d783ed/bin/uautomizer-verify-jihMAELWvX/z3
[2024-11-08 17:12:41,801 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22f3ce76-6050-4203-b56a-86e323d783ed/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null)
[2024-11-08 17:12:41,806 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22f3ce76-6050-4203-b56a-86e323d783ed/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process
[2024-11-08 17:12:41,848 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2024-11-08 17:12:41,849 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0
[2024-11-08 17:12:41,849 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not
[2024-11-08 17:12:41,849 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not
[2024-11-08 17:12:41,850 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2024-11-08 17:12:41,852 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2024-11-08 17:12:42,001 INFO L238 CfgBuilder]: Building ICFG
[2024-11-08 17:12:42,004 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation
[2024-11-08 17:12:48,244 INFO L? ?]: Removed 14 outVars from TransFormulas that were not future-live.
[2024-11-08 17:12:48,244 INFO L287 CfgBuilder]: Performing block encoding
[2024-11-08 17:12:48,260 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2024-11-08 17:12:48,260 INFO L316 CfgBuilder]: Removed 1 assume(true) statements.
[2024-11-08 17:12:48,261 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 05:12:48 BoogieIcfgContainer
[2024-11-08 17:12:48,261 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2024-11-08 17:12:48,264 INFO L112 PluginConnector]: ------------------------TraceAbstraction----------------------------
[2024-11-08 17:12:48,264 INFO L270 PluginConnector]: Initializing TraceAbstraction...
[2024-11-08 17:12:48,268 INFO L274 PluginConnector]: TraceAbstraction initialized
[2024-11-08 17:12:48,269 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 05:12:41" (1/3) ...
[2024-11-08 17:12:48,272 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1fe39c47 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 05:12:48, skipping insertion in model container
[2024-11-08 17:12:48,272 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:12:41" (2/3) ...
[2024-11-08 17:12:48,274 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1fe39c47 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 05:12:48, skipping insertion in model container
[2024-11-08 17:12:48,275 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 05:12:48" (3/3) ...
[2024-11-08 17:12:48,277 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_normal_file-63.i
[2024-11-08 17:12:48,313 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2024-11-08 17:12:48,313 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations.
[2024-11-08 17:12:48,432 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2024-11-08 17:12:48,440 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@72c77c12, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2024-11-08 17:12:48,441 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations.
[2024-11-08 17:12:48,447 INFO L276 IsEmpty]: Start isEmpty. Operand has 58 states, 39 states have (on average 1.358974358974359) internal successors, (53), 40 states have internal predecessors, (53), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16)
[2024-11-08 17:12:48,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111
[2024-11-08 17:12:48,464 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-08 17:12:48,465 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-08 17:12:48,466 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-08 17:12:48,474 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 17:12:48,475 INFO L85 PathProgramCache]: Analyzing trace with hash -1035119589, now seen corresponding path program 1 times
[2024-11-08 17:12:48,494 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX
[2024-11-08 17:12:48,496 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2074332497]
[2024-11-08 17:12:48,497 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 17:12:48,497 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3
[2024-11-08 17:12:48,498 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22f3ce76-6050-4203-b56a-86e323d783ed/bin/uautomizer-verify-jihMAELWvX/mathsat
[2024-11-08 17:12:48,502 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22f3ce76-6050-4203-b56a-86e323d783ed/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null)
[2024-11-08 17:12:48,504 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22f3ce76-6050-4203-b56a-86e323d783ed/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process
[2024-11-08 17:12:49,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:12:49,191 INFO L255 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 1 conjuncts are in the unsatisfiable core
[2024-11-08 17:12:49,201 INFO L278 TraceCheckSpWp]: Computing forward predicates...
[2024-11-08 17:12:49,252 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 206 proven. 0 refuted. 0 times theorem prover too weak. 274 trivial. 0 not checked.
[2024-11-08 17:12:49,252 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2024-11-08 17:12:49,254 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace
[2024-11-08 17:12:49,254 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2074332497]
[2024-11-08 17:12:49,255 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2074332497] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-08 17:12:49,256 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-08 17:12:49,256 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-11-08 17:12:49,258 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1085808050]
[2024-11-08 17:12:49,260 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-08 17:12:49,266 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states
[2024-11-08 17:12:49,266 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX
[2024-11-08 17:12:49,296 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants.
[2024-11-08 17:12:49,297 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2
[2024-11-08 17:12:49,300 INFO L87 Difference]: Start difference. First operand has 58 states, 39 states have (on average 1.358974358974359) internal successors, (53), 40 states have internal predecessors, (53), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) 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, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16)
[2024-11-08 17:12:49,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-08 17:12:49,349 INFO L93 Difference]: Finished difference Result 109 states and 180 transitions.
[2024-11-08 17:12:49,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states.
[2024-11-08 17:12:49,352 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, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 110
[2024-11-08 17:12:49,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-08 17:12:49,362 INFO L225 Difference]: With dead ends: 109
[2024-11-08 17:12:49,362 INFO L226 Difference]: Without dead ends: 54
[2024-11-08 17:12:49,367 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 109 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2
[2024-11-08 17:12:49,371 INFO L432 NwaCegarLoop]: 78 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 78 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2024-11-08 17:12:49,372 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2024-11-08 17:12:49,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states.
[2024-11-08 17:12:49,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54.
[2024-11-08 17:12:49,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 36 states have (on average 1.2777777777777777) internal successors, (46), 36 states have internal predecessors, (46), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16)
[2024-11-08 17:12:49,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 78 transitions.
[2024-11-08 17:12:49,451 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 78 transitions. Word has length 110
[2024-11-08 17:12:49,451 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-08 17:12:49,451 INFO L471 AbstractCegarLoop]: Abstraction has 54 states and 78 transitions.
[2024-11-08 17:12:49,452 INFO L472 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, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16)
[2024-11-08 17:12:49,452 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 78 transitions.
[2024-11-08 17:12:49,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111
[2024-11-08 17:12:49,456 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-08 17:12:49,456 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-08 17:12:49,472 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22f3ce76-6050-4203-b56a-86e323d783ed/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0
[2024-11-08 17:12:49,660 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22f3ce76-6050-4203-b56a-86e323d783ed/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3
[2024-11-08 17:12:49,661 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-08 17:12:49,662 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 17:12:49,662 INFO L85 PathProgramCache]: Analyzing trace with hash -409697329, now seen corresponding path program 1 times
[2024-11-08 17:12:49,663 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX
[2024-11-08 17:12:49,663 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1043254068]
[2024-11-08 17:12:49,664 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 17:12:49,664 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3
[2024-11-08 17:12:49,668 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22f3ce76-6050-4203-b56a-86e323d783ed/bin/uautomizer-verify-jihMAELWvX/mathsat
[2024-11-08 17:12:49,672 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22f3ce76-6050-4203-b56a-86e323d783ed/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null)
[2024-11-08 17:12:49,676 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22f3ce76-6050-4203-b56a-86e323d783ed/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process
[2024-11-08 17:12:50,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:12:50,223 INFO L255 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 6 conjuncts are in the unsatisfiable core
[2024-11-08 17:12:50,229 INFO L278 TraceCheckSpWp]: Computing forward predicates...
[2024-11-08 17:12:52,388 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked.
[2024-11-08 17:12:52,388 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2024-11-08 17:12:52,389 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace
[2024-11-08 17:12:52,389 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1043254068]
[2024-11-08 17:12:52,389 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1043254068] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-08 17:12:52,389 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-08 17:12:52,390 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2024-11-08 17:12:52,390 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2081632513]
[2024-11-08 17:12:52,390 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-08 17:12:52,392 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2024-11-08 17:12:52,392 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX
[2024-11-08 17:12:52,393 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2024-11-08 17:12:52,394 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2024-11-08 17:12:52,394 INFO L87 Difference]: Start difference. First operand 54 states and 78 transitions. Second operand has 5 states, 5 states have (on average 6.6) internal successors, (33), 4 states have internal predecessors, (33), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16)
[2024-11-08 17:12:57,320 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.12s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers []
[2024-11-08 17:12:58,409 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.09s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers []
[2024-11-08 17:13:02,618 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.07s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers []
[2024-11-08 17:13:02,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-08 17:13:02,620 INFO L93 Difference]: Finished difference Result 157 states and 229 transitions.
[2024-11-08 17:13:02,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states.
[2024-11-08 17:13:02,641 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.6) internal successors, (33), 4 states have internal predecessors, (33), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 110
[2024-11-08 17:13:02,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-08 17:13:02,644 INFO L225 Difference]: With dead ends: 157
[2024-11-08 17:13:02,645 INFO L226 Difference]: Without dead ends: 106
[2024-11-08 17:13:02,646 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 106 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42
[2024-11-08 17:13:02,647 INFO L432 NwaCegarLoop]: 71 mSDtfsCounter, 57 mSDsluCounter, 173 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 33 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 244 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.1s IncrementalHoareTripleChecker+Time
[2024-11-08 17:13:02,648 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 244 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 60 Invalid, 2 Unknown, 0 Unchecked, 10.1s Time]
[2024-11-08 17:13:02,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states.
[2024-11-08 17:13:02,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 88.
[2024-11-08 17:13:02,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 53 states have (on average 1.1886792452830188) internal successors, (63), 53 states have internal predecessors, (63), 32 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32)
[2024-11-08 17:13:02,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 127 transitions.
[2024-11-08 17:13:02,709 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 127 transitions. Word has length 110
[2024-11-08 17:13:02,710 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-08 17:13:02,712 INFO L471 AbstractCegarLoop]: Abstraction has 88 states and 127 transitions.
[2024-11-08 17:13:02,712 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.6) internal successors, (33), 4 states have internal predecessors, (33), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16)
[2024-11-08 17:13:02,712 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 127 transitions.
[2024-11-08 17:13:02,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111
[2024-11-08 17:13:02,717 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-08 17:13:02,720 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-08 17:13:02,734 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22f3ce76-6050-4203-b56a-86e323d783ed/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0
[2024-11-08 17:13:02,921 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22f3ce76-6050-4203-b56a-86e323d783ed/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3
[2024-11-08 17:13:02,921 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-08 17:13:02,922 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 17:13:02,922 INFO L85 PathProgramCache]: Analyzing trace with hash -1420814579, now seen corresponding path program 1 times
[2024-11-08 17:13:02,923 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX
[2024-11-08 17:13:02,923 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1905860456]
[2024-11-08 17:13:02,924 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 17:13:02,924 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3
[2024-11-08 17:13:02,924 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22f3ce76-6050-4203-b56a-86e323d783ed/bin/uautomizer-verify-jihMAELWvX/mathsat
[2024-11-08 17:13:02,926 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22f3ce76-6050-4203-b56a-86e323d783ed/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null)
[2024-11-08 17:13:02,927 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22f3ce76-6050-4203-b56a-86e323d783ed/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process
[2024-11-08 17:13:03,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:13:03,459 INFO L255 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 2 conjuncts are in the unsatisfiable core
[2024-11-08 17:13:03,463 INFO L278 TraceCheckSpWp]: Computing forward predicates...
[2024-11-08 17:13:03,550 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked.
[2024-11-08 17:13:03,551 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2024-11-08 17:13:03,552 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace
[2024-11-08 17:13:03,552 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1905860456]
[2024-11-08 17:13:03,553 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1905860456] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-08 17:13:03,553 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-08 17:13:03,553 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2024-11-08 17:13:03,554 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1060355695]
[2024-11-08 17:13:03,555 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-08 17:13:03,555 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-11-08 17:13:03,556 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX
[2024-11-08 17:13:03,556 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-11-08 17:13:03,559 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-11-08 17:13:03,559 INFO L87 Difference]: Start difference. First operand 88 states and 127 transitions. Second operand has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16)
[2024-11-08 17:13:06,686 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.92s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers []
[2024-11-08 17:13:06,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-08 17:13:06,764 INFO L93 Difference]: Finished difference Result 155 states and 224 transitions.
[2024-11-08 17:13:06,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2024-11-08 17:13:06,765 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 110
[2024-11-08 17:13:06,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-08 17:13:06,768 INFO L225 Difference]: With dead ends: 155
[2024-11-08 17:13:06,768 INFO L226 Difference]: Without dead ends: 104
[2024-11-08 17:13:06,769 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 108 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-11-08 17:13:06,771 INFO L432 NwaCegarLoop]: 82 mSDtfsCounter, 14 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 145 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time
[2024-11-08 17:13:06,772 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 145 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time]
[2024-11-08 17:13:06,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states.
[2024-11-08 17:13:06,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 96.
[2024-11-08 17:13:06,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 61 states have (on average 1.2131147540983607) internal successors, (74), 61 states have internal predecessors, (74), 32 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32)
[2024-11-08 17:13:06,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 138 transitions.
[2024-11-08 17:13:06,806 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 138 transitions. Word has length 110
[2024-11-08 17:13:06,807 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-08 17:13:06,807 INFO L471 AbstractCegarLoop]: Abstraction has 96 states and 138 transitions.
[2024-11-08 17:13:06,808 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16)
[2024-11-08 17:13:06,808 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 138 transitions.
[2024-11-08 17:13:06,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111
[2024-11-08 17:13:06,810 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-08 17:13:06,811 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-08 17:13:06,825 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22f3ce76-6050-4203-b56a-86e323d783ed/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0
[2024-11-08 17:13:07,011 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22f3ce76-6050-4203-b56a-86e323d783ed/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3
[2024-11-08 17:13:07,012 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-08 17:13:07,012 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 17:13:07,012 INFO L85 PathProgramCache]: Analyzing trace with hash -461584563, now seen corresponding path program 1 times
[2024-11-08 17:13:07,013 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX
[2024-11-08 17:13:07,014 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [72202049]
[2024-11-08 17:13:07,014 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 17:13:07,014 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3
[2024-11-08 17:13:07,014 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22f3ce76-6050-4203-b56a-86e323d783ed/bin/uautomizer-verify-jihMAELWvX/mathsat
[2024-11-08 17:13:07,018 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22f3ce76-6050-4203-b56a-86e323d783ed/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null)
[2024-11-08 17:13:07,020 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22f3ce76-6050-4203-b56a-86e323d783ed/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process
[2024-11-08 17:13:07,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:13:07,606 INFO L255 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 22 conjuncts are in the unsatisfiable core
[2024-11-08 17:13:07,614 INFO L278 TraceCheckSpWp]: Computing forward predicates...