./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/fermat2-ll_unwindbound10.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a046e57d Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/fermat2-ll_unwindbound10.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --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 96b71e4fe20331af08d1b5394215c6ca1c246124118142d0900823a256b0e31d --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-12 18:53:09,150 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-12 18:53:09,218 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-12 18:53:09,222 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-12 18:53:09,223 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-12 18:53:09,255 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-12 18:53:09,256 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-12 18:53:09,256 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-12 18:53:09,257 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-12 18:53:09,257 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-12 18:53:09,258 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-12 18:53:09,258 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-12 18:53:09,259 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-12 18:53:09,262 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-12 18:53:09,262 INFO L153 SettingsManager]: * Use SBE=true [2024-10-12 18:53:09,263 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-12 18:53:09,263 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-12 18:53:09,263 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-12 18:53:09,263 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-12 18:53:09,264 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-12 18:53:09,264 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-12 18:53:09,268 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-12 18:53:09,268 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-12 18:53:09,268 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-12 18:53:09,269 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-12 18:53:09,269 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-12 18:53:09,269 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-12 18:53:09,269 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-12 18:53:09,270 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-12 18:53:09,270 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-12 18:53:09,270 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-12 18:53:09,270 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-12 18:53:09,271 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-12 18:53:09,271 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-12 18:53:09,272 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-12 18:53:09,272 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-12 18:53:09,273 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-12 18:53:09,273 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-12 18:53:09,273 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-12 18:53:09,274 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-12 18:53:09,274 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-12 18:53:09,274 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-12 18:53:09,274 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:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux 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 -> 96b71e4fe20331af08d1b5394215c6ca1c246124118142d0900823a256b0e31d [2024-10-12 18:53:09,560 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-12 18:53:09,583 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-12 18:53:09,587 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-12 18:53:09,589 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-12 18:53:09,589 INFO L274 PluginConnector]: CDTParser initialized [2024-10-12 18:53:09,590 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/fermat2-ll_unwindbound10.c [2024-10-12 18:53:11,081 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-12 18:53:11,108 ERROR L? ?]: Error during toolchain job processing: java.lang.NullPointerException at org.eclipse.cdt.internal.core.model.PathEntry.kindFromString(PathEntry.java:80) at org.eclipse.cdt.internal.core.model.DefaultPathEntryStore.decodePathEntry(DefaultPathEntryStore.java:127) at org.eclipse.cdt.internal.core.model.DefaultPathEntryStore.getRawPathEntries(DefaultPathEntryStore.java:97) at org.eclipse.cdt.internal.core.model.PathEntryStoreProxy.getRawPathEntries(PathEntryStoreProxy.java:102) at org.eclipse.cdt.internal.core.model.PathEntryManager.getRawPathEntries(PathEntryManager.java:666) at org.eclipse.cdt.core.model.CoreModel.getRawPathEntries(CoreModel.java:937) at org.eclipse.cdt.core.model.CoreModel.oldIsScannerInformationEmpty(CoreModel.java:1307) at org.eclipse.cdt.core.model.CoreModel.isScannerInformationEmpty(CoreModel.java:1252) at org.eclipse.cdt.internal.core.pdom.indexer.ProjectIndexerInputAdapter.isFileBuildConfigured(ProjectIndexerInputAdapter.java:267) at org.eclipse.cdt.internal.core.pdom.AbstractIndexerTask.isRequiredInIndex(AbstractIndexerTask.java:748) at org.eclipse.cdt.internal.core.pdom.AbstractIndexerTask.extractFiles(AbstractIndexerTask.java:667) at org.eclipse.cdt.internal.core.pdom.AbstractIndexerTask.runTask(AbstractIndexerTask.java:558) at org.eclipse.cdt.internal.core.pdom.indexer.PDOMIndexerTask.run(PDOMIndexerTask.java:164) at org.eclipse.cdt.internal.core.pdom.PDOMIndexerJob.run(PDOMIndexerJob.java:160) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2024-10-12 18:53:11,280 INFO L384 CDTParser]: Found 1 translation units. [2024-10-12 18:53:11,280 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/fermat2-ll_unwindbound10.c [2024-10-12 18:53:11,287 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b45f8ef8c/ce725473d08742f3be8032d3e2ca938c/FLAG0e77adb5e [2024-10-12 18:53:11,302 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b45f8ef8c/ce725473d08742f3be8032d3e2ca938c [2024-10-12 18:53:11,305 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-12 18:53:11,307 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-12 18:53:11,308 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-12 18:53:11,308 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-12 18:53:11,313 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-12 18:53:11,316 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 06:53:11" (1/1) ... [2024-10-12 18:53:11,317 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@13e10c45 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 06:53:11, skipping insertion in model container [2024-10-12 18:53:11,318 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 06:53:11" (1/1) ... [2024-10-12 18:53:11,335 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-12 18:53:11,507 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/fermat2-ll_unwindbound10.c[524,537] [2024-10-12 18:53:11,524 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 18:53:11,535 INFO L200 MainTranslator]: Completed pre-run [2024-10-12 18:53:11,545 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/fermat2-ll_unwindbound10.c[524,537] [2024-10-12 18:53:11,551 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 18:53:11,569 INFO L204 MainTranslator]: Completed translation [2024-10-12 18:53:11,569 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 06:53:11 WrapperNode [2024-10-12 18:53:11,569 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-12 18:53:11,570 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-12 18:53:11,571 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-12 18:53:11,571 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-12 18:53:11,576 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 06:53:11" (1/1) ... [2024-10-12 18:53:11,583 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 06:53:11" (1/1) ... [2024-10-12 18:53:11,598 INFO L138 Inliner]: procedures = 14, calls = 11, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 47 [2024-10-12 18:53:11,599 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-12 18:53:11,599 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-12 18:53:11,599 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-12 18:53:11,600 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-12 18:53:11,607 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 06:53:11" (1/1) ... [2024-10-12 18:53:11,607 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 06:53:11" (1/1) ... [2024-10-12 18:53:11,608 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 06:53:11" (1/1) ... [2024-10-12 18:53:11,620 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-12 18:53:11,620 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 06:53:11" (1/1) ... [2024-10-12 18:53:11,620 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 06:53:11" (1/1) ... [2024-10-12 18:53:11,623 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 06:53:11" (1/1) ... [2024-10-12 18:53:11,626 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 06:53:11" (1/1) ... [2024-10-12 18:53:11,627 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 06:53:11" (1/1) ... [2024-10-12 18:53:11,628 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 06:53:11" (1/1) ... [2024-10-12 18:53:11,630 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-12 18:53:11,631 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-12 18:53:11,631 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-12 18:53:11,631 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-12 18:53:11,632 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 06:53:11" (1/1) ... [2024-10-12 18:53:11,638 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-12 18:53:11,650 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 18:53:11,668 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-12 18:53:11,676 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-12 18:53:11,723 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-12 18:53:11,724 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-12 18:53:11,724 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-12 18:53:11,724 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-12 18:53:11,724 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-12 18:53:11,724 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-12 18:53:11,725 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-10-12 18:53:11,725 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-10-12 18:53:11,796 INFO L238 CfgBuilder]: Building ICFG [2024-10-12 18:53:11,799 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-12 18:53:11,977 INFO L? ?]: Removed 7 outVars from TransFormulas that were not future-live. [2024-10-12 18:53:11,978 INFO L287 CfgBuilder]: Performing block encoding [2024-10-12 18:53:12,019 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-12 18:53:12,019 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-12 18:53:12,019 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 06:53:12 BoogieIcfgContainer [2024-10-12 18:53:12,019 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-12 18:53:12,022 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-12 18:53:12,022 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-12 18:53:12,026 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-12 18:53:12,027 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.10 06:53:11" (1/3) ... [2024-10-12 18:53:12,029 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4c83a25d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.10 06:53:12, skipping insertion in model container [2024-10-12 18:53:12,029 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 06:53:11" (2/3) ... [2024-10-12 18:53:12,029 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4c83a25d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.10 06:53:12, skipping insertion in model container [2024-10-12 18:53:12,029 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 06:53:12" (3/3) ... [2024-10-12 18:53:12,032 INFO L112 eAbstractionObserver]: Analyzing ICFG fermat2-ll_unwindbound10.c [2024-10-12 18:53:12,051 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-12 18:53:12,052 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-12 18:53:12,122 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-12 18:53:12,130 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;@4abbfbe6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-12 18:53:12,130 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-12 18:53:12,136 INFO L276 IsEmpty]: Start isEmpty. Operand has 22 states, 14 states have (on average 1.5) internal successors, (21), 15 states have internal predecessors, (21), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-10-12 18:53:12,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-10-12 18:53:12,145 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 18:53:12,146 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 18:53:12,147 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 18:53:12,154 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 18:53:12,155 INFO L85 PathProgramCache]: Analyzing trace with hash -1060579028, now seen corresponding path program 1 times [2024-10-12 18:53:12,164 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 18:53:12,165 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1005260261] [2024-10-12 18:53:12,165 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 18:53:12,166 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 18:53:12,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:53:12,365 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 18:53:12,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:53:12,374 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-12 18:53:12,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:53:12,389 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-12 18:53:12,390 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 18:53:12,390 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1005260261] [2024-10-12 18:53:12,390 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1005260261] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 18:53:12,391 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 18:53:12,391 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-12 18:53:12,396 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1085869773] [2024-10-12 18:53:12,397 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 18:53:12,402 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-12 18:53:12,402 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 18:53:12,426 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-12 18:53:12,427 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-12 18:53:12,429 INFO L87 Difference]: Start difference. First operand has 22 states, 14 states have (on average 1.5) internal successors, (21), 15 states have internal predecessors, (21), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-12 18:53:12,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 18:53:12,472 INFO L93 Difference]: Finished difference Result 42 states and 59 transitions. [2024-10-12 18:53:12,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-12 18:53:12,479 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 17 [2024-10-12 18:53:12,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 18:53:12,494 INFO L225 Difference]: With dead ends: 42 [2024-10-12 18:53:12,494 INFO L226 Difference]: Without dead ends: 20 [2024-10-12 18:53:12,497 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-12 18:53:12,505 INFO L432 NwaCegarLoop]: 24 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 18:53:12,506 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 24 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 18:53:12,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2024-10-12 18:53:12,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2024-10-12 18:53:12,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 14 states have internal predecessors, (17), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-12 18:53:12,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 24 transitions. [2024-10-12 18:53:12,541 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 24 transitions. Word has length 17 [2024-10-12 18:53:12,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 18:53:12,542 INFO L471 AbstractCegarLoop]: Abstraction has 20 states and 24 transitions. [2024-10-12 18:53:12,542 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-12 18:53:12,542 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 24 transitions. [2024-10-12 18:53:12,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-10-12 18:53:12,544 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 18:53:12,544 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 18:53:12,544 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-12 18:53:12,544 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 18:53:12,545 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 18:53:12,545 INFO L85 PathProgramCache]: Analyzing trace with hash -778881514, now seen corresponding path program 1 times [2024-10-12 18:53:12,546 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 18:53:12,546 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1091568925] [2024-10-12 18:53:12,546 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 18:53:12,546 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 18:53:12,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:53:12,747 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 18:53:12,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:53:12,759 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-12 18:53:12,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:53:12,773 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-12 18:53:12,773 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 18:53:12,774 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1091568925] [2024-10-12 18:53:12,774 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1091568925] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 18:53:12,774 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 18:53:12,774 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-12 18:53:12,774 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1718325714] [2024-10-12 18:53:12,775 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 18:53:12,776 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-12 18:53:12,776 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 18:53:12,777 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-12 18:53:12,777 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-12 18:53:12,777 INFO L87 Difference]: Start difference. First operand 20 states and 24 transitions. Second operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-12 18:53:12,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 18:53:12,809 INFO L93 Difference]: Finished difference Result 29 states and 33 transitions. [2024-10-12 18:53:12,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 18:53:12,812 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 18 [2024-10-12 18:53:12,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 18:53:12,813 INFO L225 Difference]: With dead ends: 29 [2024-10-12 18:53:12,813 INFO L226 Difference]: Without dead ends: 22 [2024-10-12 18:53:12,813 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-12 18:53:12,815 INFO L432 NwaCegarLoop]: 21 mSDtfsCounter, 5 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 18:53:12,817 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 54 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 18:53:12,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2024-10-12 18:53:12,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2024-10-12 18:53:12,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 16 states have internal predecessors, (19), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-12 18:53:12,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 26 transitions. [2024-10-12 18:53:12,831 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 26 transitions. Word has length 18 [2024-10-12 18:53:12,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 18:53:12,833 INFO L471 AbstractCegarLoop]: Abstraction has 22 states and 26 transitions. [2024-10-12 18:53:12,833 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-12 18:53:12,834 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 26 transitions. [2024-10-12 18:53:12,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-10-12 18:53:12,835 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 18:53:12,835 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 18:53:12,836 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-12 18:53:12,836 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 18:53:12,837 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 18:53:12,838 INFO L85 PathProgramCache]: Analyzing trace with hash -777094054, now seen corresponding path program 1 times [2024-10-12 18:53:12,838 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 18:53:12,839 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1457582999] [2024-10-12 18:53:12,839 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 18:53:12,839 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 18:53:12,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-12 18:53:12,893 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [30959875] [2024-10-12 18:53:12,893 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 18:53:12,894 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 18:53:12,894 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 18:53:12,898 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-12 18:53:12,900 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-12 18:53:12,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:53:12,980 INFO L255 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-12 18:53:12,988 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 18:53:13,272 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-12 18:53:13,272 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-12 18:53:13,272 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 18:53:13,272 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1457582999] [2024-10-12 18:53:13,273 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-10-12 18:53:13,273 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [30959875] [2024-10-12 18:53:13,273 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [30959875] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 18:53:13,273 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 18:53:13,274 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-12 18:53:13,274 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1961480614] [2024-10-12 18:53:13,274 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 18:53:13,276 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-12 18:53:13,276 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 18:53:13,277 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-12 18:53:13,278 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-12 18:53:13,278 INFO L87 Difference]: Start difference. First operand 22 states and 26 transitions. Second operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-12 18:53:14,685 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.35s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-10-12 18:53:14,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 18:53:14,714 INFO L93 Difference]: Finished difference Result 34 states and 41 transitions. [2024-10-12 18:53:14,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-12 18:53:14,714 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 18 [2024-10-12 18:53:14,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 18:53:14,717 INFO L225 Difference]: With dead ends: 34 [2024-10-12 18:53:14,717 INFO L226 Difference]: Without dead ends: 32 [2024-10-12 18:53:14,717 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-12 18:53:14,718 INFO L432 NwaCegarLoop]: 18 mSDtfsCounter, 5 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-10-12 18:53:14,718 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 68 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-10-12 18:53:14,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2024-10-12 18:53:14,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 31. [2024-10-12 18:53:14,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 22 states have (on average 1.3181818181818181) internal successors, (29), 23 states have internal predecessors, (29), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-10-12 18:53:14,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 38 transitions. [2024-10-12 18:53:14,729 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 38 transitions. Word has length 18 [2024-10-12 18:53:14,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 18:53:14,729 INFO L471 AbstractCegarLoop]: Abstraction has 31 states and 38 transitions. [2024-10-12 18:53:14,729 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-12 18:53:14,730 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 38 transitions. [2024-10-12 18:53:14,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-10-12 18:53:14,730 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 18:53:14,731 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 18:53:14,748 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-10-12 18:53:14,931 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 18:53:14,932 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 18:53:14,932 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 18:53:14,932 INFO L85 PathProgramCache]: Analyzing trace with hash -331201790, now seen corresponding path program 1 times [2024-10-12 18:53:14,932 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 18:53:14,933 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [180235766] [2024-10-12 18:53:14,933 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 18:53:14,933 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 18:53:14,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:53:15,230 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 18:53:15,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:53:15,240 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-12 18:53:15,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:53:15,253 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-12 18:53:15,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:53:15,348 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-12 18:53:15,349 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 18:53:15,350 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [180235766] [2024-10-12 18:53:15,350 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [180235766] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 18:53:15,350 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [782807793] [2024-10-12 18:53:15,351 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 18:53:15,351 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 18:53:15,351 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 18:53:15,354 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-12 18:53:15,356 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-12 18:53:15,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:53:15,413 INFO L255 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-10-12 18:53:15,415 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 18:53:15,494 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-12 18:53:15,495 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 18:53:15,641 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-12 18:53:15,641 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [782807793] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-12 18:53:15,641 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-12 18:53:15,641 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 8] total 12 [2024-10-12 18:53:15,642 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [172209286] [2024-10-12 18:53:15,642 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-12 18:53:15,642 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-12 18:53:15,642 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 18:53:15,643 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-12 18:53:15,646 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2024-10-12 18:53:15,646 INFO L87 Difference]: Start difference. First operand 31 states and 38 transitions. Second operand has 12 states, 11 states have (on average 1.8181818181818181) internal successors, (20), 8 states have internal predecessors, (20), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 4 states have call predecessors, (5), 1 states have call successors, (5) [2024-10-12 18:53:15,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 18:53:15,757 INFO L93 Difference]: Finished difference Result 38 states and 44 transitions. [2024-10-12 18:53:15,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-12 18:53:15,760 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 1.8181818181818181) internal successors, (20), 8 states have internal predecessors, (20), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 4 states have call predecessors, (5), 1 states have call successors, (5) Word has length 24 [2024-10-12 18:53:15,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 18:53:15,761 INFO L225 Difference]: With dead ends: 38 [2024-10-12 18:53:15,761 INFO L226 Difference]: Without dead ends: 33 [2024-10-12 18:53:15,761 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 48 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2024-10-12 18:53:15,762 INFO L432 NwaCegarLoop]: 16 mSDtfsCounter, 12 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 113 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 18:53:15,763 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 113 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 18:53:15,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2024-10-12 18:53:15,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 24. [2024-10-12 18:53:15,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 17 states have (on average 1.1176470588235294) internal successors, (19), 17 states have internal predecessors, (19), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-12 18:53:15,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 26 transitions. [2024-10-12 18:53:15,771 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 26 transitions. Word has length 24 [2024-10-12 18:53:15,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 18:53:15,771 INFO L471 AbstractCegarLoop]: Abstraction has 24 states and 26 transitions. [2024-10-12 18:53:15,771 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 1.8181818181818181) internal successors, (20), 8 states have internal predecessors, (20), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 4 states have call predecessors, (5), 1 states have call successors, (5) [2024-10-12 18:53:15,771 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 26 transitions. [2024-10-12 18:53:15,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-10-12 18:53:15,772 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 18:53:15,772 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 18:53:15,790 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-12 18:53:15,976 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2024-10-12 18:53:15,977 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 18:53:15,977 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 18:53:15,977 INFO L85 PathProgramCache]: Analyzing trace with hash -1584280999, now seen corresponding path program 1 times [2024-10-12 18:53:15,977 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 18:53:15,978 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [636330503] [2024-10-12 18:53:15,978 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 18:53:15,978 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 18:53:15,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:53:16,055 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 18:53:16,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:53:16,062 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-12 18:53:16,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:53:16,073 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-12 18:53:16,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:53:16,081 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-12 18:53:16,081 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 18:53:16,082 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [636330503] [2024-10-12 18:53:16,082 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [636330503] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 18:53:16,082 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1017345215] [2024-10-12 18:53:16,082 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 18:53:16,082 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 18:53:16,082 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 18:53:16,087 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-12 18:53:16,088 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-12 18:53:16,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:53:16,136 INFO L255 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-12 18:53:16,137 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 18:53:16,188 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-12 18:53:16,188 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 18:53:16,246 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-12 18:53:16,246 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1017345215] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-12 18:53:16,247 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-12 18:53:16,248 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4, 5] total 10 [2024-10-12 18:53:16,248 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1712634284] [2024-10-12 18:53:16,248 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-12 18:53:16,248 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-12 18:53:16,248 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 18:53:16,249 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-12 18:53:16,249 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2024-10-12 18:53:16,249 INFO L87 Difference]: Start difference. First operand 24 states and 26 transitions. Second operand has 10 states, 10 states have (on average 3.5) internal successors, (35), 10 states have internal predecessors, (35), 6 states have call successors, (10), 4 states have call predecessors, (10), 3 states have return successors, (9), 5 states have call predecessors, (9), 5 states have call successors, (9) [2024-10-12 18:53:16,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 18:53:16,320 INFO L93 Difference]: Finished difference Result 56 states and 63 transitions. [2024-10-12 18:53:16,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-12 18:53:16,321 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.5) internal successors, (35), 10 states have internal predecessors, (35), 6 states have call successors, (10), 4 states have call predecessors, (10), 3 states have return successors, (9), 5 states have call predecessors, (9), 5 states have call successors, (9) Word has length 27 [2024-10-12 18:53:16,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 18:53:16,322 INFO L225 Difference]: With dead ends: 56 [2024-10-12 18:53:16,322 INFO L226 Difference]: Without dead ends: 51 [2024-10-12 18:53:16,323 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2024-10-12 18:53:16,323 INFO L432 NwaCegarLoop]: 20 mSDtfsCounter, 20 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 100 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 18:53:16,324 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 100 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 18:53:16,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2024-10-12 18:53:16,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2024-10-12 18:53:16,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 38 states have (on average 1.131578947368421) internal successors, (43), 38 states have internal predecessors, (43), 7 states have call successors, (7), 6 states have call predecessors, (7), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-10-12 18:53:16,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 56 transitions. [2024-10-12 18:53:16,342 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 56 transitions. Word has length 27 [2024-10-12 18:53:16,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 18:53:16,343 INFO L471 AbstractCegarLoop]: Abstraction has 51 states and 56 transitions. [2024-10-12 18:53:16,343 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.5) internal successors, (35), 10 states have internal predecessors, (35), 6 states have call successors, (10), 4 states have call predecessors, (10), 3 states have return successors, (9), 5 states have call predecessors, (9), 5 states have call successors, (9) [2024-10-12 18:53:16,345 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 56 transitions. [2024-10-12 18:53:16,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-10-12 18:53:16,347 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 18:53:16,347 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 18:53:16,363 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-10-12 18:53:16,548 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 18:53:16,548 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 18:53:16,549 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 18:53:16,549 INFO L85 PathProgramCache]: Analyzing trace with hash -1262136106, now seen corresponding path program 2 times [2024-10-12 18:53:16,549 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 18:53:16,550 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1317908162] [2024-10-12 18:53:16,550 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 18:53:16,551 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 18:53:16,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:53:16,735 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 18:53:16,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:53:16,740 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-12 18:53:16,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:53:16,744 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-12 18:53:16,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:53:16,748 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-12 18:53:16,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:53:16,753 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-12 18:53:16,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:53:16,757 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-12 18:53:16,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:53:16,761 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 8 proven. 38 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-10-12 18:53:16,761 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 18:53:16,762 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1317908162] [2024-10-12 18:53:16,762 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1317908162] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 18:53:16,762 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [259274682] [2024-10-12 18:53:16,762 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-12 18:53:16,762 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 18:53:16,762 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 18:53:16,765 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-12 18:53:16,766 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-10-12 18:53:16,821 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-12 18:53:16,821 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-12 18:53:16,822 INFO L255 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-10-12 18:53:16,824 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 18:53:16,910 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 8 proven. 62 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-12 18:53:16,912 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 18:53:17,060 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 8 proven. 38 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-10-12 18:53:17,061 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [259274682] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-12 18:53:17,062 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-12 18:53:17,062 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7, 8] total 16 [2024-10-12 18:53:17,062 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [811210979] [2024-10-12 18:53:17,062 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-12 18:53:17,063 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-10-12 18:53:17,063 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 18:53:17,064 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-10-12 18:53:17,064 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=144, Unknown=0, NotChecked=0, Total=240 [2024-10-12 18:53:17,064 INFO L87 Difference]: Start difference. First operand 51 states and 56 transitions. Second operand has 16 states, 16 states have (on average 4.25) internal successors, (68), 16 states have internal predecessors, (68), 12 states have call successors, (19), 7 states have call predecessors, (19), 6 states have return successors, (18), 11 states have call predecessors, (18), 11 states have call successors, (18) [2024-10-12 18:53:17,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 18:53:17,309 INFO L93 Difference]: Finished difference Result 110 states and 126 transitions. [2024-10-12 18:53:17,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-10-12 18:53:17,311 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 4.25) internal successors, (68), 16 states have internal predecessors, (68), 12 states have call successors, (19), 7 states have call predecessors, (19), 6 states have return successors, (18), 11 states have call predecessors, (18), 11 states have call successors, (18) Word has length 54 [2024-10-12 18:53:17,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 18:53:17,313 INFO L225 Difference]: With dead ends: 110 [2024-10-12 18:53:17,313 INFO L226 Difference]: Without dead ends: 105 [2024-10-12 18:53:17,313 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=196, Invalid=356, Unknown=0, NotChecked=0, Total=552 [2024-10-12 18:53:17,314 INFO L432 NwaCegarLoop]: 20 mSDtfsCounter, 80 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 111 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 18:53:17,314 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 111 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 18:53:17,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2024-10-12 18:53:17,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 105. [2024-10-12 18:53:17,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 80 states have (on average 1.1375) internal successors, (91), 80 states have internal predecessors, (91), 13 states have call successors, (13), 12 states have call predecessors, (13), 11 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-12 18:53:17,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 116 transitions. [2024-10-12 18:53:17,344 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 116 transitions. Word has length 54 [2024-10-12 18:53:17,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 18:53:17,344 INFO L471 AbstractCegarLoop]: Abstraction has 105 states and 116 transitions. [2024-10-12 18:53:17,344 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 4.25) internal successors, (68), 16 states have internal predecessors, (68), 12 states have call successors, (19), 7 states have call predecessors, (19), 6 states have return successors, (18), 11 states have call predecessors, (18), 11 states have call successors, (18) [2024-10-12 18:53:17,344 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 116 transitions. [2024-10-12 18:53:17,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-10-12 18:53:17,346 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 18:53:17,346 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 10, 10, 10, 10, 10, 10, 10, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 18:53:17,363 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-10-12 18:53:17,549 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 18:53:17,550 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 18:53:17,550 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 18:53:17,550 INFO L85 PathProgramCache]: Analyzing trace with hash -254685450, now seen corresponding path program 3 times [2024-10-12 18:53:17,551 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 18:53:17,551 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1330554270] [2024-10-12 18:53:17,551 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 18:53:17,551 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 18:53:17,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-12 18:53:17,604 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [519721696] [2024-10-12 18:53:17,604 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-10-12 18:53:17,605 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 18:53:17,605 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 18:53:17,606 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-12 18:53:17,608 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-10-12 18:53:17,884 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2024-10-12 18:53:17,885 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2024-10-12 18:53:17,885 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 18:53:17,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 18:53:17,978 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 18:53:17,978 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-12 18:53:17,980 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-12 18:53:17,990 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-10-12 18:53:18,182 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 18:53:18,186 INFO L407 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1] [2024-10-12 18:53:18,231 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-12 18:53:18,234 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.10 06:53:18 BoogieIcfgContainer [2024-10-12 18:53:18,234 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-12 18:53:18,234 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-12 18:53:18,234 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-12 18:53:18,235 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-12 18:53:18,235 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 06:53:12" (3/4) ... [2024-10-12 18:53:18,236 INFO L133 WitnessPrinter]: Generating witness for reachability counterexample [2024-10-12 18:53:18,315 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-12 18:53:18,315 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-12 18:53:18,316 INFO L158 Benchmark]: Toolchain (without parser) took 7009.54ms. Allocated memory was 138.4MB in the beginning and 169.9MB in the end (delta: 31.5MB). Free memory was 83.7MB in the beginning and 136.7MB in the end (delta: -53.0MB). Peak memory consumption was 78.5MB. Max. memory is 16.1GB. [2024-10-12 18:53:18,316 INFO L158 Benchmark]: CDTParser took 0.25ms. Allocated memory is still 138.4MB. Free memory is still 110.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-12 18:53:18,316 INFO L158 Benchmark]: CACSL2BoogieTranslator took 261.67ms. Allocated memory is still 138.4MB. Free memory was 83.7MB in the beginning and 71.3MB in the end (delta: 12.3MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-10-12 18:53:18,317 INFO L158 Benchmark]: Boogie Procedure Inliner took 28.47ms. Allocated memory is still 138.4MB. Free memory was 71.0MB in the beginning and 69.7MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-12 18:53:18,317 INFO L158 Benchmark]: Boogie Preprocessor took 30.63ms. Allocated memory is still 138.4MB. Free memory was 69.7MB in the beginning and 67.9MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-12 18:53:18,317 INFO L158 Benchmark]: RCFGBuilder took 388.83ms. Allocated memory is still 138.4MB. Free memory was 67.9MB in the beginning and 55.7MB in the end (delta: 12.2MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-10-12 18:53:18,318 INFO L158 Benchmark]: TraceAbstraction took 6212.34ms. Allocated memory was 138.4MB in the beginning and 169.9MB in the end (delta: 31.5MB). Free memory was 55.1MB in the beginning and 44.6MB in the end (delta: 10.5MB). Peak memory consumption was 45.0MB. Max. memory is 16.1GB. [2024-10-12 18:53:18,318 INFO L158 Benchmark]: Witness Printer took 80.98ms. Allocated memory is still 169.9MB. Free memory was 44.6MB in the beginning and 136.7MB in the end (delta: -92.1MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-10-12 18:53:18,319 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.25ms. Allocated memory is still 138.4MB. Free memory is still 110.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 261.67ms. Allocated memory is still 138.4MB. Free memory was 83.7MB in the beginning and 71.3MB in the end (delta: 12.3MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 28.47ms. Allocated memory is still 138.4MB. Free memory was 71.0MB in the beginning and 69.7MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 30.63ms. Allocated memory is still 138.4MB. Free memory was 69.7MB in the beginning and 67.9MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 388.83ms. Allocated memory is still 138.4MB. Free memory was 67.9MB in the beginning and 55.7MB in the end (delta: 12.2MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * TraceAbstraction took 6212.34ms. Allocated memory was 138.4MB in the beginning and 169.9MB in the end (delta: 31.5MB). Free memory was 55.1MB in the beginning and 44.6MB in the end (delta: 10.5MB). Peak memory consumption was 45.0MB. Max. memory is 16.1GB. * Witness Printer took 80.98ms. Allocated memory is still 169.9MB. Free memory was 44.6MB in the beginning and 136.7MB in the end (delta: -92.1MB). Peak memory consumption was 6.3MB. 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 - CounterExampleResult [Line: 14]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L19] int counter = 0; [L21] int A, R; [L22] long long u, v, r; [L23] A = __VERIFIER_nondet_int() [L24] R = __VERIFIER_nondet_int() [L26] CALL assume_abort_if_not(((long long) R - 1) * ((long long) R - 1) < A) VAL [\old(cond)=1, counter=0] [L9] COND FALSE !(!cond) VAL [\old(cond)=1, counter=0] [L26] RET assume_abort_if_not(((long long) R - 1) * ((long long) R - 1) < A) VAL [A=2603, R=52, counter=0] [L28] CALL assume_abort_if_not(A % 2 == 1) VAL [\old(cond)=1, counter=0] [L9] COND FALSE !(!cond) VAL [\old(cond)=1, counter=0] [L28] RET assume_abort_if_not(A % 2 == 1) VAL [A=2603, R=52, counter=0] [L30] u = ((long long) 2 * R) + 1 [L31] v = 1 [L32] r = ((long long) R * R) - A VAL [A=2603, counter=0, r=101, u=105, v=1] [L34] EXPR counter++ VAL [A=2603, counter=1, r=101, u=105, v=1] [L34] COND TRUE counter++<10 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=1] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=1] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=2603, counter=1, r=101, u=105, v=1] [L36] COND FALSE !(!(r != 0)) VAL [A=2603, counter=1, r=101, u=105, v=1] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=2603, counter=1, r=100, u=105, v=3] [L34] EXPR counter++ VAL [A=2603, counter=2, r=100, u=105, v=3] [L34] COND TRUE counter++<10 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=2] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=2] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=2603, counter=2, r=100, u=105, v=3] [L36] COND FALSE !(!(r != 0)) VAL [A=2603, counter=2, r=100, u=105, v=3] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=2603, counter=2, r=97, u=105, v=5] [L34] EXPR counter++ VAL [A=2603, counter=3, r=97, u=105, v=5] [L34] COND TRUE counter++<10 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=3] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=3] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=2603, counter=3, r=97, u=105, v=5] [L36] COND FALSE !(!(r != 0)) VAL [A=2603, counter=3, r=97, u=105, v=5] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=2603, counter=3, r=92, u=105, v=7] [L34] EXPR counter++ VAL [A=2603, counter=4, r=92, u=105, v=7] [L34] COND TRUE counter++<10 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=4] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=4] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=2603, counter=4, r=92, u=105, v=7] [L36] COND FALSE !(!(r != 0)) VAL [A=2603, counter=4, r=92, u=105, v=7] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=2603, counter=4, r=85, u=105, v=9] [L34] EXPR counter++ VAL [A=2603, counter=5, r=85, u=105, v=9] [L34] COND TRUE counter++<10 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=5] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=5] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=2603, counter=5, r=85, u=105, v=9] [L36] COND FALSE !(!(r != 0)) VAL [A=2603, counter=5, r=85, u=105, v=9] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=2603, counter=5, r=76, u=105, v=11] [L34] EXPR counter++ VAL [A=2603, counter=6, r=76, u=105, v=11] [L34] COND TRUE counter++<10 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=6] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=6] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=2603, counter=6, r=76, u=105, v=11] [L36] COND FALSE !(!(r != 0)) VAL [A=2603, counter=6, r=76, u=105, v=11] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=2603, counter=6, r=65, u=105, v=13] [L34] EXPR counter++ VAL [A=2603, counter=7, r=65, u=105, v=13] [L34] COND TRUE counter++<10 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=7] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=7] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=2603, counter=7, r=65, u=105, v=13] [L36] COND FALSE !(!(r != 0)) VAL [A=2603, counter=7, r=65, u=105, v=13] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=2603, counter=7, r=52, u=105, v=15] [L34] EXPR counter++ VAL [A=2603, counter=8, r=52, u=105, v=15] [L34] COND TRUE counter++<10 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=8] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=8] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=2603, counter=8, r=52, u=105, v=15] [L36] COND FALSE !(!(r != 0)) VAL [A=2603, counter=8, r=52, u=105, v=15] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=2603, counter=8, r=37, u=105, v=17] [L34] EXPR counter++ VAL [A=2603, counter=9, r=37, u=105, v=17] [L34] COND TRUE counter++<10 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=9] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=9] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=2603, counter=9, r=37, u=105, v=17] [L36] COND FALSE !(!(r != 0)) VAL [A=2603, counter=9, r=37, u=105, v=17] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=2603, counter=9, r=20, u=105, v=19] [L34] EXPR counter++ VAL [A=2603, counter=10, r=20, u=105, v=19] [L34] COND TRUE counter++<10 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=10] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=10] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=2603, counter=10, r=20, u=105, v=19] [L36] COND FALSE !(!(r != 0)) VAL [A=2603, counter=10, r=20, u=105, v=19] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=2603, counter=10, r=1, u=105, v=21] [L34] EXPR counter++ VAL [A=2603, counter=11, r=1, u=105, v=21] [L34] COND FALSE !(counter++<10) [L48] CALL __VERIFIER_assert(((long long) 4*A) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=0, counter=11] [L12] COND TRUE !(cond) VAL [\old(cond)=0, counter=11] [L14] reach_error() VAL [\old(cond)=0, counter=11] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 22 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 6.1s, OverallIterations: 7, TraceHistogramMax: 11, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 2.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 123 SdHoareTripleChecker+Valid, 1.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 122 mSDsluCounter, 470 SdHoareTripleChecker+Invalid, 1.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 351 mSDsCounter, 20 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 186 IncrementalHoareTripleChecker+Invalid, 206 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 20 mSolverCounterUnsat, 119 mSDtfsCounter, 186 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 293 GetRequests, 242 SyntacticMatches, 2 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 118 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=105occurred in iteration=6, InterpolantAutomatonStates: 51, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 6 MinimizatonAttempts, 10 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 1.8s InterpolantComputationTime, 497 NumberOfCodeBlocks, 497 NumberOfCodeBlocksAsserted, 23 NumberOfCheckSat, 356 ConstructedInterpolants, 0 QuantifiedInterpolants, 955 SizeOfPredicates, 7 NumberOfNonLiveVariables, 371 ConjunctsInSsa, 35 ConjunctsInUnsatCore, 12 InterpolantComputations, 3 PerfectInterpolantSequences, 129/276 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 proved your program to be incorrect! [2024-10-12 18:53:18,346 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE