./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-benchs/filter2_alt.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-benchs/filter2_alt.c -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/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 5bc48f0b37b49094aa2ed7125525fbb7b9a95c5af6fff8426a24c4fcf99bb295 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 00:21:54,061 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 00:21:54,137 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-11 00:21:54,141 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 00:21:54,142 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 00:21:54,162 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 00:21:54,163 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 00:21:54,164 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 00:21:54,164 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 00:21:54,165 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 00:21:54,167 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 00:21:54,167 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 00:21:54,168 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 00:21:54,170 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 00:21:54,171 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 00:21:54,172 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 00:21:54,172 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 00:21:54,172 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 00:21:54,172 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 00:21:54,173 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 00:21:54,173 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 00:21:54,178 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 00:21:54,178 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 00:21:54,178 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 00:21:54,178 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 00:21:54,179 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 00:21:54,179 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 00:21:54,179 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 00:21:54,179 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 00:21:54,179 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 00:21:54,180 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 00:21:54,180 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 00:21:54,180 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 00:21:54,180 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 00:21:54,181 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 00:21:54,181 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 00:21:54,183 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 00:21:54,183 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 00:21:54,184 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 00:21:54,184 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 00:21:54,184 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 00:21:54,184 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 00:21:54,185 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-clean/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-clean/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 -> 5bc48f0b37b49094aa2ed7125525fbb7b9a95c5af6fff8426a24c4fcf99bb295 [2024-10-11 00:21:54,434 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 00:21:54,466 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 00:21:54,469 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 00:21:54,471 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 00:21:54,471 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 00:21:54,473 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-benchs/filter2_alt.c [2024-10-11 00:21:55,947 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 00:21:56,146 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 00:21:56,147 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-benchs/filter2_alt.c [2024-10-11 00:21:56,154 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/48ec91261/edb2b5a3a93141faa1164ebd78d08ad0/FLAG9824e30fc [2024-10-11 00:21:56,171 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/48ec91261/edb2b5a3a93141faa1164ebd78d08ad0 [2024-10-11 00:21:56,175 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 00:21:56,176 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 00:21:56,180 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 00:21:56,180 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 00:21:56,185 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 00:21:56,186 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 12:21:56" (1/1) ... [2024-10-11 00:21:56,187 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@56875154 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:21:56, skipping insertion in model container [2024-10-11 00:21:56,187 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 12:21:56" (1/1) ... [2024-10-11 00:21:56,207 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 00:21:56,393 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/float-benchs/filter2_alt.c[631,644] [2024-10-11 00:21:56,416 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 00:21:56,429 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 00:21:56,442 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/float-benchs/filter2_alt.c[631,644] [2024-10-11 00:21:56,449 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 00:21:56,466 INFO L204 MainTranslator]: Completed translation [2024-10-11 00:21:56,467 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:21:56 WrapperNode [2024-10-11 00:21:56,467 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 00:21:56,468 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 00:21:56,469 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 00:21:56,469 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 00:21:56,475 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:21:56" (1/1) ... [2024-10-11 00:21:56,481 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:21:56" (1/1) ... [2024-10-11 00:21:56,502 INFO L138 Inliner]: procedures = 19, calls = 30, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 73 [2024-10-11 00:21:56,502 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 00:21:56,503 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 00:21:56,503 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 00:21:56,503 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 00:21:56,513 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:21:56" (1/1) ... [2024-10-11 00:21:56,513 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:21:56" (1/1) ... [2024-10-11 00:21:56,515 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:21:56" (1/1) ... [2024-10-11 00:21:56,529 INFO L175 MemorySlicer]: Split 18 memory accesses to 3 slices as follows [2, 8, 8]. 44 percent of accesses are in the largest equivalence class. The 6 initializations are split as follows [2, 2, 2]. The 6 writes are split as follows [0, 3, 3]. [2024-10-11 00:21:56,530 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:21:56" (1/1) ... [2024-10-11 00:21:56,530 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:21:56" (1/1) ... [2024-10-11 00:21:56,536 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:21:56" (1/1) ... [2024-10-11 00:21:56,539 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:21:56" (1/1) ... [2024-10-11 00:21:56,541 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:21:56" (1/1) ... [2024-10-11 00:21:56,542 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:21:56" (1/1) ... [2024-10-11 00:21:56,544 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 00:21:56,544 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 00:21:56,544 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 00:21:56,545 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 00:21:56,546 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:21:56" (1/1) ... [2024-10-11 00:21:56,552 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 00:21:56,563 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 00:21:56,580 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 00:21:56,587 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 00:21:56,637 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 00:21:56,638 INFO L130 BoogieDeclarations]: Found specification of procedure RANDOM_INPUT [2024-10-11 00:21:56,638 INFO L138 BoogieDeclarations]: Found implementation of procedure RANDOM_INPUT [2024-10-11 00:21:56,638 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 00:21:56,638 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-11 00:21:56,638 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-10-11 00:21:56,639 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#0 [2024-10-11 00:21:56,640 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#1 [2024-10-11 00:21:56,640 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#2 [2024-10-11 00:21:56,641 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2024-10-11 00:21:56,641 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2024-10-11 00:21:56,641 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#2 [2024-10-11 00:21:56,641 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 00:21:56,641 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 00:21:56,641 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#0 [2024-10-11 00:21:56,642 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#1 [2024-10-11 00:21:56,642 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#2 [2024-10-11 00:21:56,763 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 00:21:56,768 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 00:21:56,961 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2024-10-11 00:21:56,962 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 00:21:57,063 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 00:21:57,064 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 00:21:57,064 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 12:21:57 BoogieIcfgContainer [2024-10-11 00:21:57,064 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 00:21:57,070 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 00:21:57,076 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 00:21:57,079 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 00:21:57,080 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 12:21:56" (1/3) ... [2024-10-11 00:21:57,086 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@44aea224 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 12:21:57, skipping insertion in model container [2024-10-11 00:21:57,087 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:21:56" (2/3) ... [2024-10-11 00:21:57,087 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@44aea224 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 12:21:57, skipping insertion in model container [2024-10-11 00:21:57,087 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 12:21:57" (3/3) ... [2024-10-11 00:21:57,091 INFO L112 eAbstractionObserver]: Analyzing ICFG filter2_alt.c [2024-10-11 00:21:57,110 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 00:21:57,110 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 00:21:57,180 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 00:21:57,189 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;@4a73b1d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 00:21:57,191 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 00:21:57,195 INFO L276 IsEmpty]: Start isEmpty. Operand has 18 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 14 states have internal predecessors, (19), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-11 00:21:57,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-10-11 00:21:57,203 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 00:21:57,204 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 00:21:57,205 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 00:21:57,209 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 00:21:57,210 INFO L85 PathProgramCache]: Analyzing trace with hash 476706587, now seen corresponding path program 1 times [2024-10-11 00:21:57,217 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 00:21:57,217 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [871620001] [2024-10-11 00:21:57,217 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 00:21:57,218 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 00:21:57,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 00:21:57,360 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 00:21:57,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 00:21:57,376 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 00:21:57,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 00:21:57,388 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-11 00:21:57,388 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 00:21:57,389 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [871620001] [2024-10-11 00:21:57,389 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [871620001] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 00:21:57,389 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 00:21:57,390 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 00:21:57,391 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [432226427] [2024-10-11 00:21:57,392 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 00:21:57,395 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 00:21:57,396 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 00:21:57,423 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 00:21:57,424 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 00:21:57,426 INFO L87 Difference]: Start difference. First operand has 18 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 14 states have internal predecessors, (19), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-11 00:21:57,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 00:21:57,470 INFO L93 Difference]: Finished difference Result 32 states and 44 transitions. [2024-10-11 00:21:57,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 00:21:57,473 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 17 [2024-10-11 00:21:57,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 00:21:57,480 INFO L225 Difference]: With dead ends: 32 [2024-10-11 00:21:57,481 INFO L226 Difference]: Without dead ends: 16 [2024-10-11 00:21:57,484 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-11 00:21:57,488 INFO L432 NwaCegarLoop]: 15 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 15 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 00:21:57,493 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 15 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 00:21:57,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2024-10-11 00:21:57,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2024-10-11 00:21:57,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 12 states have internal predecessors, (14), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-11 00:21:57,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 18 transitions. [2024-10-11 00:21:57,527 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 18 transitions. Word has length 17 [2024-10-11 00:21:57,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 00:21:57,528 INFO L471 AbstractCegarLoop]: Abstraction has 16 states and 18 transitions. [2024-10-11 00:21:57,528 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-11 00:21:57,528 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 18 transitions. [2024-10-11 00:21:57,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-10-11 00:21:57,530 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 00:21:57,530 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 00:21:57,531 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 00:21:57,531 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 00:21:57,532 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 00:21:57,532 INFO L85 PathProgramCache]: Analyzing trace with hash 1240596699, now seen corresponding path program 1 times [2024-10-11 00:21:57,532 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 00:21:57,532 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1733817115] [2024-10-11 00:21:57,533 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 00:21:57,533 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 00:21:57,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 00:21:57,712 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 00:21:57,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 00:21:57,724 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 00:21:57,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 00:21:57,743 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-11 00:21:57,747 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 00:21:57,748 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1733817115] [2024-10-11 00:21:57,748 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1733817115] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 00:21:57,748 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 00:21:57,748 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 00:21:57,748 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [272083340] [2024-10-11 00:21:57,750 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 00:21:57,751 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 00:21:57,751 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 00:21:57,752 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 00:21:57,752 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 00:21:57,752 INFO L87 Difference]: Start difference. First operand 16 states and 18 transitions. Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-11 00:21:57,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 00:21:57,787 INFO L93 Difference]: Finished difference Result 38 states and 42 transitions. [2024-10-11 00:21:57,787 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 00:21:57,788 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 17 [2024-10-11 00:21:57,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 00:21:57,789 INFO L225 Difference]: With dead ends: 38 [2024-10-11 00:21:57,789 INFO L226 Difference]: Without dead ends: 25 [2024-10-11 00:21:57,789 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 00:21:57,790 INFO L432 NwaCegarLoop]: 16 mSDtfsCounter, 5 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 00:21:57,791 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 28 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 00:21:57,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2024-10-11 00:21:57,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 24. [2024-10-11 00:21:57,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 18 states have (on average 1.1111111111111112) internal successors, (20), 18 states have internal predecessors, (20), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-11 00:21:57,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 26 transitions. [2024-10-11 00:21:57,804 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 26 transitions. Word has length 17 [2024-10-11 00:21:57,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 00:21:57,804 INFO L471 AbstractCegarLoop]: Abstraction has 24 states and 26 transitions. [2024-10-11 00:21:57,805 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-11 00:21:57,805 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 26 transitions. [2024-10-11 00:21:57,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-10-11 00:21:57,807 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 00:21:57,807 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 00:21:57,807 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 00:21:57,808 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 00:21:57,808 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 00:21:57,811 INFO L85 PathProgramCache]: Analyzing trace with hash -1543740561, now seen corresponding path program 1 times [2024-10-11 00:21:57,811 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 00:21:57,812 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [956422545] [2024-10-11 00:21:57,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 00:21:57,812 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 00:21:57,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 00:21:57,854 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-11 00:21:57,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 00:21:57,938 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-11 00:21:57,941 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-11 00:21:57,943 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-11 00:21:57,945 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 00:21:57,948 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2024-10-11 00:21:57,990 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-11 00:21:57,997 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.10 12:21:57 BoogieIcfgContainer [2024-10-11 00:21:58,000 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-11 00:21:58,001 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-11 00:21:58,001 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-11 00:21:58,001 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-11 00:21:58,002 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 12:21:57" (3/4) ... [2024-10-11 00:21:58,005 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-11 00:21:58,006 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-11 00:21:58,007 INFO L158 Benchmark]: Toolchain (without parser) took 1831.36ms. Allocated memory is still 140.5MB. Free memory was 88.1MB in the beginning and 65.7MB in the end (delta: 22.4MB). Peak memory consumption was 23.0MB. Max. memory is 16.1GB. [2024-10-11 00:21:58,008 INFO L158 Benchmark]: CDTParser took 0.44ms. Allocated memory is still 140.5MB. Free memory is still 100.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 00:21:58,008 INFO L158 Benchmark]: CACSL2BoogieTranslator took 288.03ms. Allocated memory is still 140.5MB. Free memory was 88.1MB in the beginning and 75.5MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-10-11 00:21:58,009 INFO L158 Benchmark]: Boogie Procedure Inliner took 33.88ms. Allocated memory is still 140.5MB. Free memory was 75.1MB in the beginning and 73.6MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-11 00:21:58,010 INFO L158 Benchmark]: Boogie Preprocessor took 40.72ms. Allocated memory is still 140.5MB. Free memory was 73.6MB in the beginning and 71.3MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-11 00:21:58,011 INFO L158 Benchmark]: RCFGBuilder took 519.71ms. Allocated memory is still 140.5MB. Free memory was 71.3MB in the beginning and 109.7MB in the end (delta: -38.4MB). Peak memory consumption was 16.7MB. Max. memory is 16.1GB. [2024-10-11 00:21:58,011 INFO L158 Benchmark]: TraceAbstraction took 930.17ms. Allocated memory is still 140.5MB. Free memory was 109.1MB in the beginning and 65.7MB in the end (delta: 43.4MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. [2024-10-11 00:21:58,013 INFO L158 Benchmark]: Witness Printer took 5.65ms. Allocated memory is still 140.5MB. Free memory is still 65.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 00:21:58,014 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.44ms. Allocated memory is still 140.5MB. Free memory is still 100.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 288.03ms. Allocated memory is still 140.5MB. Free memory was 88.1MB in the beginning and 75.5MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 33.88ms. Allocated memory is still 140.5MB. Free memory was 75.1MB in the beginning and 73.6MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 40.72ms. Allocated memory is still 140.5MB. Free memory was 73.6MB in the beginning and 71.3MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 519.71ms. Allocated memory is still 140.5MB. Free memory was 71.3MB in the beginning and 109.7MB in the end (delta: -38.4MB). Peak memory consumption was 16.7MB. Max. memory is 16.1GB. * TraceAbstraction took 930.17ms. Allocated memory is still 140.5MB. Free memory was 109.1MB in the beginning and 65.7MB in the end (delta: 43.4MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. * Witness Printer took 5.65ms. Allocated memory is still 140.5MB. Free memory is still 65.7MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 14]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 43, overapproximation of someBinaryArithmeticFLOAToperation at line 38. Possible FailurePath: [L19] BOOLEAN INIT; [L20] float P, X; [L32] static float E[2], S[2]; [L32] static float E[2], S[2]; [L32] static float E[2], S[2]; [L32] static float E[2], S[2]; [L32] static float E[2], S[2]; [L32] static float E[2], S[2]; [L52] CALL, EXPR RANDOM_INPUT() VAL [E={4:0}, INIT=0, P=0, S={5:0}, X=0] [L24] float x; [L25] x = __VERIFIER_nondet_float() [L26] CALL assume_abort_if_not(x >= -10.f && x <= 10.f) [L12] COND FALSE !(!cond) VAL [E={4:0}, INIT=0, P=0, S={5:0}, X=0] [L26] RET assume_abort_if_not(x >= -10.f && x <= 10.f) [L27] return x; [L52] RET, EXPR RANDOM_INPUT() VAL [E={4:0}, INIT=0, P=0, S={5:0}, X=0] [L52] X = RANDOM_INPUT() [L53] INIT = TRUE VAL [E={4:0}, INIT=1, P=0, S={5:0}, X=64] [L54] COND TRUE \read(TRUE) VAL [E={4:0}, INIT=1, P=0, S={5:0}, X=64] [L55] CALL, EXPR RANDOM_INPUT() VAL [E={4:0}, INIT=1, P=0, S={5:0}, X=64] [L24] float x; [L25] x = __VERIFIER_nondet_float() [L26] CALL assume_abort_if_not(x >= -10.f && x <= 10.f) [L12] COND FALSE !(!cond) VAL [E={4:0}, INIT=1, P=0, S={5:0}, X=64] [L26] RET assume_abort_if_not(x >= -10.f && x <= 10.f) [L27] return x; [L55] RET, EXPR RANDOM_INPUT() VAL [E={4:0}, INIT=1, P=0, S={5:0}, X=64] [L55] X = RANDOM_INPUT() [L56] CALL filter2 () [L33] COND TRUE \read(INIT) [L34] S[0] = X [L35] P = X [L36] E[0] = X VAL [E={4:0}, INIT=1, P=66, S={5:0}, X=66] [L46] EXPR E[0] [L46] E[1] = E[0] [L46] E[0] = X [L47] EXPR S[0] [L47] S[1] = S[0] [L47] S[0] = P [L56] RET filter2 () [L57] INIT = FALSE VAL [E={4:0}, INIT=0, P=66, S={5:0}, X=66] [L54] COND TRUE \read(TRUE) VAL [E={4:0}, INIT=0, P=66, S={5:0}, X=66] [L55] CALL, EXPR RANDOM_INPUT() VAL [E={4:0}, INIT=0, P=66, S={5:0}, X=66] [L24] float x; [L25] x = __VERIFIER_nondet_float() [L26] CALL assume_abort_if_not(x >= -10.f && x <= 10.f) [L12] COND FALSE !(!cond) VAL [E={4:0}, INIT=0, P=66, S={5:0}, X=66] [L26] RET assume_abort_if_not(x >= -10.f && x <= 10.f) [L27] return x; [L55] RET, EXPR RANDOM_INPUT() VAL [E={4:0}, INIT=0, P=66, S={5:0}, X=66] [L55] X = RANDOM_INPUT() [L56] CALL filter2 () [L33] COND FALSE !(\read(INIT)) [L39] EXPR E[0] [L40] EXPR E[1] [L41] EXPR S[0] [L42] EXPR S[1] [L38-L42] P = (((((0.4677826f * X) - (E[0] * 0.7700725f)) + (E[1] * 0.4344376f)) + (S[0] * 1.5419f)) - (S[1] * 0.6740477f)) [L43] CALL __VERIFIER_assert(P >= -15.f && P <= 15.f) [L14] COND TRUE !(cond) VAL [E={4:0}, INIT=0, S={5:0}, X=65] [L14] reach_error() VAL [E={4:0}, INIT=0, S={5:0}, X=65] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 18 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 0.8s, OverallIterations: 3, TraceHistogramMax: 3, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 5 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 5 mSDsluCounter, 43 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 12 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 13 IncrementalHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 31 mSDtfsCounter, 13 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 15 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=24occurred in iteration=2, InterpolantAutomatonStates: 5, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 1 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.2s InterpolantComputationTime, 60 NumberOfCodeBlocks, 60 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 32 ConstructedInterpolants, 0 QuantifiedInterpolants, 40 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 2 InterpolantComputations, 2 PerfectInterpolantSequences, 8/8 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-10-11 00:21:58,046 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-benchs/filter2_alt.c -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/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 5bc48f0b37b49094aa2ed7125525fbb7b9a95c5af6fff8426a24c4fcf99bb295 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 00:22:00,388 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 00:22:00,485 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-11 00:22:00,491 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 00:22:00,491 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 00:22:00,521 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 00:22:00,522 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 00:22:00,522 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 00:22:00,523 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 00:22:00,527 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 00:22:00,527 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 00:22:00,528 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 00:22:00,528 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 00:22:00,529 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 00:22:00,529 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 00:22:00,529 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 00:22:00,530 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 00:22:00,530 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 00:22:00,530 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 00:22:00,530 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 00:22:00,530 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 00:22:00,532 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 00:22:00,533 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 00:22:00,534 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-11 00:22:00,534 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-11 00:22:00,534 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 00:22:00,534 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-11 00:22:00,535 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 00:22:00,535 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 00:22:00,535 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 00:22:00,535 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 00:22:00,536 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 00:22:00,536 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 00:22:00,537 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 00:22:00,537 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 00:22:00,538 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 00:22:00,538 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 00:22:00,538 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 00:22:00,538 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-11 00:22:00,538 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-11 00:22:00,539 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 00:22:00,540 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 00:22:00,540 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 00:22:00,540 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 00:22:00,540 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-11 00:22:00,540 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-clean/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-clean/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 -> 5bc48f0b37b49094aa2ed7125525fbb7b9a95c5af6fff8426a24c4fcf99bb295 [2024-10-11 00:22:00,907 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 00:22:00,940 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 00:22:00,943 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 00:22:00,945 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 00:22:00,946 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 00:22:00,948 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-benchs/filter2_alt.c [2024-10-11 00:22:02,723 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 00:22:02,925 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 00:22:02,926 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-benchs/filter2_alt.c [2024-10-11 00:22:02,934 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/fb07c035c/7c07b68073344117b367ad19d96c5fcb/FLAG163369b3b [2024-10-11 00:22:02,947 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/fb07c035c/7c07b68073344117b367ad19d96c5fcb [2024-10-11 00:22:02,949 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 00:22:02,951 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 00:22:02,952 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 00:22:02,952 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 00:22:02,960 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 00:22:02,961 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 12:22:02" (1/1) ... [2024-10-11 00:22:02,962 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@27175033 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:22:02, skipping insertion in model container [2024-10-11 00:22:02,962 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 12:22:02" (1/1) ... [2024-10-11 00:22:02,981 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 00:22:03,185 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/float-benchs/filter2_alt.c[631,644] [2024-10-11 00:22:03,214 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 00:22:03,236 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 00:22:03,250 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/float-benchs/filter2_alt.c[631,644] [2024-10-11 00:22:03,263 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 00:22:03,284 INFO L204 MainTranslator]: Completed translation [2024-10-11 00:22:03,284 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:22:03 WrapperNode [2024-10-11 00:22:03,285 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 00:22:03,286 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 00:22:03,286 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 00:22:03,286 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 00:22:03,293 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:22:03" (1/1) ... [2024-10-11 00:22:03,304 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:22:03" (1/1) ... [2024-10-11 00:22:03,330 INFO L138 Inliner]: procedures = 20, calls = 30, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 74 [2024-10-11 00:22:03,330 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 00:22:03,334 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 00:22:03,334 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 00:22:03,334 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 00:22:03,344 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:22:03" (1/1) ... [2024-10-11 00:22:03,344 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:22:03" (1/1) ... [2024-10-11 00:22:03,347 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:22:03" (1/1) ... [2024-10-11 00:22:03,376 INFO L175 MemorySlicer]: Split 18 memory accesses to 3 slices as follows [2, 8, 8]. 44 percent of accesses are in the largest equivalence class. The 6 initializations are split as follows [2, 2, 2]. The 6 writes are split as follows [0, 3, 3]. [2024-10-11 00:22:03,378 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:22:03" (1/1) ... [2024-10-11 00:22:03,378 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:22:03" (1/1) ... [2024-10-11 00:22:03,391 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:22:03" (1/1) ... [2024-10-11 00:22:03,395 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:22:03" (1/1) ... [2024-10-11 00:22:03,401 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:22:03" (1/1) ... [2024-10-11 00:22:03,403 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:22:03" (1/1) ... [2024-10-11 00:22:03,410 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 00:22:03,411 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 00:22:03,411 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 00:22:03,411 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 00:22:03,412 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:22:03" (1/1) ... [2024-10-11 00:22:03,421 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 00:22:03,434 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 00:22:03,453 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 00:22:03,457 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 00:22:03,505 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 00:22:03,505 INFO L130 BoogieDeclarations]: Found specification of procedure RANDOM_INPUT [2024-10-11 00:22:03,505 INFO L138 BoogieDeclarations]: Found implementation of procedure RANDOM_INPUT [2024-10-11 00:22:03,505 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#0 [2024-10-11 00:22:03,507 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#1 [2024-10-11 00:22:03,507 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#2 [2024-10-11 00:22:03,508 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-11 00:22:03,508 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-10-11 00:22:03,508 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2024-10-11 00:22:03,508 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#0 [2024-10-11 00:22:03,508 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#1 [2024-10-11 00:22:03,508 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#2 [2024-10-11 00:22:03,508 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 00:22:03,509 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 00:22:03,509 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#0 [2024-10-11 00:22:03,509 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#1 [2024-10-11 00:22:03,509 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#2 [2024-10-11 00:22:03,634 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 00:22:03,637 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 00:22:07,935 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2024-10-11 00:22:07,936 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 00:22:08,002 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 00:22:08,003 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 00:22:08,004 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 12:22:08 BoogieIcfgContainer [2024-10-11 00:22:08,004 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 00:22:08,007 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 00:22:08,007 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 00:22:08,011 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 00:22:08,011 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 12:22:02" (1/3) ... [2024-10-11 00:22:08,012 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@744e03a3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 12:22:08, skipping insertion in model container [2024-10-11 00:22:08,012 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:22:03" (2/3) ... [2024-10-11 00:22:08,013 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@744e03a3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 12:22:08, skipping insertion in model container [2024-10-11 00:22:08,013 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 12:22:08" (3/3) ... [2024-10-11 00:22:08,014 INFO L112 eAbstractionObserver]: Analyzing ICFG filter2_alt.c [2024-10-11 00:22:08,031 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 00:22:08,032 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 00:22:08,096 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 00:22:08,104 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;@3ad8ae9d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 00:22:08,107 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 00:22:08,111 INFO L276 IsEmpty]: Start isEmpty. Operand has 18 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 14 states have internal predecessors, (19), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-11 00:22:08,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-10-11 00:22:08,119 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 00:22:08,120 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 00:22:08,120 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 00:22:08,125 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 00:22:08,126 INFO L85 PathProgramCache]: Analyzing trace with hash 476706587, now seen corresponding path program 1 times [2024-10-11 00:22:08,138 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 00:22:08,139 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [905569577] [2024-10-11 00:22:08,139 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 00:22:08,139 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 00:22:08,140 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 00:22:08,143 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 00:22:08,145 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-10-11 00:22:08,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 00:22:08,528 INFO L255 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-11 00:22:08,533 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 00:22:08,560 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-11 00:22:08,561 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 00:22:08,561 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 00:22:08,562 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [905569577] [2024-10-11 00:22:08,562 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [905569577] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 00:22:08,562 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 00:22:08,562 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 00:22:08,564 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [6369822] [2024-10-11 00:22:08,565 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 00:22:08,569 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 00:22:08,570 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 00:22:08,594 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 00:22:08,596 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 00:22:08,598 INFO L87 Difference]: Start difference. First operand has 18 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 14 states have internal predecessors, (19), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-11 00:22:08,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 00:22:08,649 INFO L93 Difference]: Finished difference Result 32 states and 44 transitions. [2024-10-11 00:22:08,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 00:22:08,652 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 17 [2024-10-11 00:22:08,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 00:22:08,657 INFO L225 Difference]: With dead ends: 32 [2024-10-11 00:22:08,657 INFO L226 Difference]: Without dead ends: 16 [2024-10-11 00:22:08,660 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 16 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-11 00:22:08,663 INFO L432 NwaCegarLoop]: 15 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 15 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 00:22:08,664 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 15 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 00:22:08,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2024-10-11 00:22:08,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2024-10-11 00:22:08,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 12 states have internal predecessors, (14), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-11 00:22:08,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 18 transitions. [2024-10-11 00:22:08,691 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 18 transitions. Word has length 17 [2024-10-11 00:22:08,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 00:22:08,691 INFO L471 AbstractCegarLoop]: Abstraction has 16 states and 18 transitions. [2024-10-11 00:22:08,691 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-11 00:22:08,692 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 18 transitions. [2024-10-11 00:22:08,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-10-11 00:22:08,693 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 00:22:08,693 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 00:22:08,705 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-10-11 00:22:08,894 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 00:22:08,895 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 00:22:08,895 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 00:22:08,896 INFO L85 PathProgramCache]: Analyzing trace with hash 1240596699, now seen corresponding path program 1 times [2024-10-11 00:22:08,896 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 00:22:08,896 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [738800098] [2024-10-11 00:22:08,896 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 00:22:08,897 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 00:22:08,898 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 00:22:08,901 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 00:22:08,902 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-10-11 00:22:09,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 00:22:09,263 INFO L255 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-11 00:22:09,265 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 00:22:09,437 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 00:22:09,438 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 00:22:09,438 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 00:22:09,438 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [738800098] [2024-10-11 00:22:09,438 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [738800098] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 00:22:09,439 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 00:22:09,439 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 00:22:09,439 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [715951819] [2024-10-11 00:22:09,439 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 00:22:09,440 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 00:22:09,441 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 00:22:09,441 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 00:22:09,442 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 00:22:09,442 INFO L87 Difference]: Start difference. First operand 16 states and 18 transitions. Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-11 00:22:13,679 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.13s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-10-11 00:22:13,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 00:22:13,680 INFO L93 Difference]: Finished difference Result 38 states and 42 transitions. [2024-10-11 00:22:13,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 00:22:13,731 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 17 [2024-10-11 00:22:13,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 00:22:13,733 INFO L225 Difference]: With dead ends: 38 [2024-10-11 00:22:13,733 INFO L226 Difference]: Without dead ends: 25 [2024-10-11 00:22:13,733 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 00:22:13,734 INFO L432 NwaCegarLoop]: 16 mSDtfsCounter, 1 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2024-10-11 00:22:13,735 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 28 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 1 Unknown, 0 Unchecked, 4.2s Time] [2024-10-11 00:22:13,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2024-10-11 00:22:13,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 24. [2024-10-11 00:22:13,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 18 states have (on average 1.1111111111111112) internal successors, (20), 18 states have internal predecessors, (20), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-11 00:22:13,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 26 transitions. [2024-10-11 00:22:13,744 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 26 transitions. Word has length 17 [2024-10-11 00:22:13,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 00:22:13,744 INFO L471 AbstractCegarLoop]: Abstraction has 24 states and 26 transitions. [2024-10-11 00:22:13,744 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-11 00:22:13,745 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 26 transitions. [2024-10-11 00:22:13,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-10-11 00:22:13,745 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 00:22:13,745 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 00:22:13,761 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2024-10-11 00:22:13,946 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 00:22:13,947 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 00:22:13,947 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 00:22:13,947 INFO L85 PathProgramCache]: Analyzing trace with hash -1543740561, now seen corresponding path program 1 times [2024-10-11 00:22:13,948 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 00:22:13,948 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [225282222] [2024-10-11 00:22:13,948 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 00:22:13,948 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 00:22:13,949 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 00:22:13,951 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 00:22:13,952 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-10-11 00:22:18,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 00:22:19,007 INFO L255 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 32 conjuncts are in the unsatisfiable core [2024-10-11 00:22:19,019 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 00:22:20,265 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-10-11 00:22:20,421 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-10-11 00:22:20,735 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 236 treesize of output 138 [2024-10-11 00:22:20,783 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 99 treesize of output 49 [2024-10-11 00:22:25,166 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 00:22:25,166 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 579 treesize of output 429 [2024-10-11 00:22:25,315 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 00:22:25,316 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 459 treesize of output 309 [2024-10-11 00:22:33,490 WARN L286 SmtUtils]: Spent 8.14s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-10-11 00:22:41,577 WARN L286 SmtUtils]: Spent 8.09s on a formula simplification that was a NOOP. DAG size: 46 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-10-11 00:22:49,718 WARN L286 SmtUtils]: Spent 8.14s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-10-11 00:22:57,798 WARN L286 SmtUtils]: Spent 8.08s on a formula simplification that was a NOOP. DAG size: 45 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-10-11 00:23:05,961 WARN L286 SmtUtils]: Spent 8.16s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-10-11 00:23:14,106 WARN L286 SmtUtils]: Spent 8.14s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-10-11 00:23:22,276 WARN L286 SmtUtils]: Spent 8.15s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-10-11 00:23:30,481 WARN L286 SmtUtils]: Spent 8.20s on a formula simplification that was a NOOP. DAG size: 45 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)